./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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.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 c082dc45380b26d7d2efa14a2b9a25a882bb361e7db7c29c901ddfabd3b29352 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:26:38,262 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:26:38,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:26:38,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:26:38,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:26:38,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:26:38,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:26:38,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:26:38,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:26:38,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:26:38,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:26:38,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:26:38,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:26:38,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:26:38,348 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:26:38,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:26:38,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:26:38,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:26:38,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:26:38,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:26:38,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:26:38,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:26:38,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:26:38,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:26:38,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:26:38,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:26:38,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:26:38,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:26:38,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:26:38,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:26:38,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:26:38,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:26:38,351 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 -> c082dc45380b26d7d2efa14a2b9a25a882bb361e7db7c29c901ddfabd3b29352 [2025-03-08 06:26:38,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:26:38,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:26:38,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:26:38,591 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:26:38,591 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:26:38,592 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:26:39,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d80e40d1/c170d111741844119fe1a98dc8f9da14/FLAGf4fbe93f9 [2025-03-08 06:26:40,102 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:26:40,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:26:40,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d80e40d1/c170d111741844119fe1a98dc8f9da14/FLAGf4fbe93f9 [2025-03-08 06:26:40,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d80e40d1/c170d111741844119fe1a98dc8f9da14 [2025-03-08 06:26:40,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:26:40,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:26:40,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:26:40,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:26:40,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:26:40,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:40,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f93efe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40, skipping insertion in model container [2025-03-08 06:26:40,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:40,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:26:40,483 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33110,33123] [2025-03-08 06:26:40,526 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[47435,47448] [2025-03-08 06:26:40,541 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[54586,54599] [2025-03-08 06:26:40,551 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[58145,58158] [2025-03-08 06:26:40,560 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[61485,61498] [2025-03-08 06:26:40,589 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[76732,76745] [2025-03-08 06:26:40,600 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[83878,83891] [2025-03-08 06:26:40,606 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[87432,87445] [2025-03-08 06:26:40,614 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90767,90780] [2025-03-08 06:26:40,622 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[94900,94913] [2025-03-08 06:26:40,628 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[98301,98314] [2025-03-08 06:26:40,637 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[101855,101868] [2025-03-08 06:26:40,642 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[105190,105203] [2025-03-08 06:26:40,648 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[108944,108957] [2025-03-08 06:26:40,654 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[112294,112307] [2025-03-08 06:26:40,659 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[115829,115842] [2025-03-08 06:26:40,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:26:40,699 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:26:40,770 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[33110,33123] [2025-03-08 06:26:40,805 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[47435,47448] [2025-03-08 06:26:40,813 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[54586,54599] [2025-03-08 06:26:40,819 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[58145,58158] [2025-03-08 06:26:40,824 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[61485,61498] [2025-03-08 06:26:40,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[76732,76745] [2025-03-08 06:26:40,852 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[83878,83891] [2025-03-08 06:26:40,857 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[87432,87445] [2025-03-08 06:26:40,863 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[90767,90780] [2025-03-08 06:26:40,869 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[94900,94913] [2025-03-08 06:26:40,874 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[98301,98314] [2025-03-08 06:26:40,879 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[101855,101868] [2025-03-08 06:26:40,884 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[105190,105203] [2025-03-08 06:26:40,889 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.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[108944,108957] [2025-03-08 06:26:40,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[112294,112307] [2025-03-08 06:26:40,899 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[115829,115842] [2025-03-08 06:26:40,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:26:40,931 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:26:40,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40 WrapperNode [2025-03-08 06:26:40,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:26:40,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:26:40,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:26:40,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:26:40,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:40,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,039 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 5769 [2025-03-08 06:26:41,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:26:41,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:26:41,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:26:41,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:26:41,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,103 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-08 06:26:41,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:26:41,219 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:26:41,219 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:26:41,220 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:26:41,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (1/1) ... [2025-03-08 06:26:41,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:26:41,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:26:41,248 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-08 06:26:41,251 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-08 06:26:41,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:26:41,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:26:41,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:26:41,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:26:41,451 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:26:41,452 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:26:43,747 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7369: 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-08 06:26:43,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7767: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~39#1; [2025-03-08 06:26:43,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4861: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~18#1; [2025-03-08 06:26:43,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2747: 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-08 06:26:43,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2618: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~12#1; [2025-03-08 06:26:43,748 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5660: 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-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9492: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6058: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~25#1; [2025-03-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7645: 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-08 06:26:43,749 INFO L1307 $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-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9364: havoc main_~node3__m3~36#1; [2025-03-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8309: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~35#1; [2025-03-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5933: 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-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4878: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~20#1; [2025-03-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1316: 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-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6075: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~30#1; [2025-03-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1452: havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__m4~5#1; [2025-03-08 06:26:43,749 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:26:43,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7927: 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-08 06:26:43,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8192: 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-08 06:26:43,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8326: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~42#1; [2025-03-08 06:26:43,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3045: 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-08 06:26:43,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4895: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-08 06:26:43,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9520: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-08 06:26:43,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3178: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~15#1; [2025-03-08 06:26:43,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1598: 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-08 06:26:43,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8866: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~45#1; [2025-03-08 06:26:43,750 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9396: havoc main_~node4__m4~40#1; [2025-03-08 06:26:43,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~6#1; [2025-03-08 06:26:43,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:26:43,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6624: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~33#1; [2025-03-08 06:26:43,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6229: 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-08 06:26:43,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6502: 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-08 06:26:43,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3332: 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-08 06:26:43,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8486: 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-08 06:26:43,751 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3730: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~15#1; [2025-03-08 06:26:43,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8752: 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-08 06:26:43,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-08 06:26:43,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7169: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~27#1; [2025-03-08 06:26:43,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9548: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:26:43,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5056: 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-08 06:26:43,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3605: 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-08 06:26:43,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9291: 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-08 06:26:43,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9029: 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-08 06:26:43,753 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6784: 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-08 06:26:43,753 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: 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-08 06:26:43,753 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7049: 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-08 06:26:43,753 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2029: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~9#1; [2025-03-08 06:26:43,753 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3747: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~18#1; [2025-03-08 06:26:43,753 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-08 06:26:43,753 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7186: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~30#1; [2025-03-08 06:26:43,754 INFO L1307 $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-08 06:26:43,754 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9577: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:26:43,754 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: 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-08 06:26:43,754 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4296: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~21#1; [2025-03-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7203: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~36#1; [2025-03-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2183: 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-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3901: 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-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2584: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~9#1; [2025-03-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2456: 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-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4174: 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-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9332: havoc main_~node2__m2~34#1; [2025-03-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9464: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~48#1; [2025-03-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4844: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~17#1; [2025-03-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5373: 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-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5506: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~27#1; [2025-03-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2601: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4456: 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-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L889: havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node5__m5~3#1; [2025-03-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4721: 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-08 06:26:43,755 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1023: 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-08 06:26:43,932 INFO L? ?]: Removed 1024 outVars from TransFormulas that were not future-live. [2025-03-08 06:26:43,933 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:26:43,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:26:43,963 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:26:43,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:26:43 BoogieIcfgContainer [2025-03-08 06:26:43,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:26:43,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:26:43,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:26:43,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:26:43,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:26:40" (1/3) ... [2025-03-08 06:26:43,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17beb164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:26:43, skipping insertion in model container [2025-03-08 06:26:43,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:26:40" (2/3) ... [2025-03-08 06:26:43,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17beb164 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:26:43, skipping insertion in model container [2025-03-08 06:26:43,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:26:43" (3/3) ... [2025-03-08 06:26:43,970 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:26:43,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:26:43,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.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-08 06:26:44,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:26:44,061 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;@58ea441d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:26:44,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-08 06:26:44,068 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-08 06:26:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:26:44,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:44,087 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-08 06:26:44,088 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-08 06:26:44,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:44,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1374374570, now seen corresponding path program 1 times [2025-03-08 06:26:44,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:44,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296723805] [2025-03-08 06:26:44,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:44,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:44,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:26:44,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:26:44,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:44,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:44,535 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-08 06:26:44,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:44,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296723805] [2025-03-08 06:26:44,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296723805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:44,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:44,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:44,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966027712] [2025-03-08 06:26:44,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:44,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:44,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:44,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:44,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:44,567 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-08 06:26:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:45,335 INFO L93 Difference]: Finished difference Result 1449 states and 2552 transitions. [2025-03-08 06:26:45,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:45,338 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-08 06:26:45,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:45,349 INFO L225 Difference]: With dead ends: 1449 [2025-03-08 06:26:45,349 INFO L226 Difference]: Without dead ends: 871 [2025-03-08 06:26:45,355 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-08 06:26:45,357 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 4511 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:45,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 857 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:26:45,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-03-08 06:26:45,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2025-03-08 06:26:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 855 states have (on average 1.3192982456140352) internal successors, (1128), 870 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1128 transitions. [2025-03-08 06:26:45,414 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1128 transitions. Word has length 72 [2025-03-08 06:26:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:45,415 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1128 transitions. [2025-03-08 06:26:45,415 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-08 06:26:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1128 transitions. [2025-03-08 06:26:45,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:26:45,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:45,419 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-08 06:26:45,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:26:45,420 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:26:45,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:45,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2039915490, now seen corresponding path program 1 times [2025-03-08 06:26:45,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:45,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037643294] [2025-03-08 06:26:45,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:45,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:45,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:26:45,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:26:45,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:45,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:45,584 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-08 06:26:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:45,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037643294] [2025-03-08 06:26:45,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037643294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:45,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:45,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:45,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974376284] [2025-03-08 06:26:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:45,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:45,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:45,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:45,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:45,587 INFO L87 Difference]: Start difference. First operand 871 states and 1128 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-08 06:26:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:45,984 INFO L93 Difference]: Finished difference Result 1136 states and 1469 transitions. [2025-03-08 06:26:45,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:45,984 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-08 06:26:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:45,987 INFO L225 Difference]: With dead ends: 1136 [2025-03-08 06:26:45,988 INFO L226 Difference]: Without dead ends: 690 [2025-03-08 06:26:45,990 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-08 06:26:45,991 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 2643 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2643 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:45,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2643 Valid, 438 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:26:45,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-08 06:26:46,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2025-03-08 06:26:46,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 674 states have (on average 1.3382789317507418) internal successors, (902), 689 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 902 transitions. [2025-03-08 06:26:46,007 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 902 transitions. Word has length 72 [2025-03-08 06:26:46,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:46,007 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 902 transitions. [2025-03-08 06:26:46,007 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-08 06:26:46,007 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 902 transitions. [2025-03-08 06:26:46,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 06:26:46,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:46,009 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-08 06:26:46,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:26:46,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:26:46,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash -242534019, now seen corresponding path program 1 times [2025-03-08 06:26:46,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:46,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374323875] [2025-03-08 06:26:46,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:46,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:46,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 06:26:46,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 06:26:46,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:46,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:46,208 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-08 06:26:46,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:46,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374323875] [2025-03-08 06:26:46,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374323875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:46,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:46,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821813958] [2025-03-08 06:26:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:46,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:46,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:46,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:46,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:46,210 INFO L87 Difference]: Start difference. First operand 690 states and 902 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-08 06:26:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:46,474 INFO L93 Difference]: Finished difference Result 827 states and 1066 transitions. [2025-03-08 06:26:46,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:46,474 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-08 06:26:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:46,476 INFO L225 Difference]: With dead ends: 827 [2025-03-08 06:26:46,476 INFO L226 Difference]: Without dead ends: 476 [2025-03-08 06:26:46,476 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-08 06:26:46,477 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 1767 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:46,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 344 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:26:46,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-03-08 06:26:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 476. [2025-03-08 06:26:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 460 states have (on average 1.3413043478260869) internal successors, (617), 475 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 617 transitions. [2025-03-08 06:26:46,483 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 617 transitions. Word has length 72 [2025-03-08 06:26:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:46,483 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 617 transitions. [2025-03-08 06:26:46,483 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-08 06:26:46,484 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 617 transitions. [2025-03-08 06:26:46,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:26:46,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:46,485 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-08 06:26:46,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:26:46,485 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-08 06:26:46,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1882388166, now seen corresponding path program 1 times [2025-03-08 06:26:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:46,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493259092] [2025-03-08 06:26:46,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:46,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:26:46,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:26:46,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:46,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:46,598 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-08 06:26:46,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:46,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493259092] [2025-03-08 06:26:46,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493259092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:46,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:46,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:46,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596051125] [2025-03-08 06:26:46,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:46,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:46,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:46,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:46,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:46,600 INFO L87 Difference]: Start difference. First operand 476 states and 617 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-08 06:26:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:46,790 INFO L93 Difference]: Finished difference Result 653 states and 844 transitions. [2025-03-08 06:26:46,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:46,790 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-08 06:26:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:46,792 INFO L225 Difference]: With dead ends: 653 [2025-03-08 06:26:46,792 INFO L226 Difference]: Without dead ends: 398 [2025-03-08 06:26:46,792 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-08 06:26:46,793 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1475 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:46,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 308 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:26:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-08 06:26:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-03-08 06:26:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.3481675392670156) internal successors, (515), 397 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 515 transitions. [2025-03-08 06:26:46,802 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 515 transitions. Word has length 73 [2025-03-08 06:26:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:46,802 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 515 transitions. [2025-03-08 06:26:46,802 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-08 06:26:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 515 transitions. [2025-03-08 06:26:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:26:46,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:46,804 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-08 06:26:46,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:26:46,804 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-08 06:26:46,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:46,805 INFO L85 PathProgramCache]: Analyzing trace with hash 286689312, now seen corresponding path program 1 times [2025-03-08 06:26:46,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:46,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200636727] [2025-03-08 06:26:46,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:46,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:46,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:26:46,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:26:46,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:46,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:46,917 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-08 06:26:46,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:46,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200636727] [2025-03-08 06:26:46,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200636727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:46,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:46,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:26:46,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258877781] [2025-03-08 06:26:46,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:46,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:26:46,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:46,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:26:46,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:26:46,919 INFO L87 Difference]: Start difference. First operand 398 states and 515 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-08 06:26:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:47,143 INFO L93 Difference]: Finished difference Result 610 states and 797 transitions. [2025-03-08 06:26:47,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:26:47,144 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-08 06:26:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:47,145 INFO L225 Difference]: With dead ends: 610 [2025-03-08 06:26:47,145 INFO L226 Difference]: Without dead ends: 390 [2025-03-08 06:26:47,146 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-08 06:26:47,146 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1411 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:47,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 281 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:26:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-08 06:26:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-03-08 06:26:47,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3502673796791445) internal successors, (505), 389 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 505 transitions. [2025-03-08 06:26:47,154 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 505 transitions. Word has length 74 [2025-03-08 06:26:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:47,154 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 505 transitions. [2025-03-08 06:26:47,154 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-08 06:26:47,154 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 505 transitions. [2025-03-08 06:26:47,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:26:47,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:47,156 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-08 06:26:47,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:26:47,156 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-08 06:26:47,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1296343751, now seen corresponding path program 1 times [2025-03-08 06:26:47,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:47,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644774764] [2025-03-08 06:26:47,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:47,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:47,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:26:47,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:26:47,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:47,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:47,540 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-08 06:26:47,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:47,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644774764] [2025-03-08 06:26:47,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644774764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:47,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:47,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:26:47,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079183361] [2025-03-08 06:26:47,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:47,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:26:47,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:47,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:26:47,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:26:47,542 INFO L87 Difference]: Start difference. First operand 390 states and 505 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-08 06:26:48,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:48,012 INFO L93 Difference]: Finished difference Result 754 states and 962 transitions. [2025-03-08 06:26:48,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:26:48,012 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-08 06:26:48,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:48,014 INFO L225 Difference]: With dead ends: 754 [2025-03-08 06:26:48,014 INFO L226 Difference]: Without dead ends: 542 [2025-03-08 06:26:48,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:26:48,015 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 2424 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2424 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:48,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2424 Valid, 893 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:26:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-08 06:26:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 390. [2025-03-08 06:26:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3475935828877006) internal successors, (504), 389 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 504 transitions. [2025-03-08 06:26:48,022 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 504 transitions. Word has length 75 [2025-03-08 06:26:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:48,023 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 504 transitions. [2025-03-08 06:26:48,023 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-08 06:26:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 504 transitions. [2025-03-08 06:26:48,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:26:48,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:48,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] [2025-03-08 06:26:48,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:26:48,024 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-08 06:26:48,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1445156994, now seen corresponding path program 1 times [2025-03-08 06:26:48,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:48,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374856007] [2025-03-08 06:26:48,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:48,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:48,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:26:48,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:26:48,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:48,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:48,296 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-08 06:26:48,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:48,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374856007] [2025-03-08 06:26:48,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374856007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:48,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:48,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331962219] [2025-03-08 06:26:48,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:48,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:48,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:48,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:48,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:48,298 INFO L87 Difference]: Start difference. First operand 390 states and 504 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-08 06:26:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:49,001 INFO L93 Difference]: Finished difference Result 733 states and 967 transitions. [2025-03-08 06:26:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:26:49,002 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-08 06:26:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:49,003 INFO L225 Difference]: With dead ends: 733 [2025-03-08 06:26:49,003 INFO L226 Difference]: Without dead ends: 605 [2025-03-08 06:26:49,004 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-08 06:26:49,004 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 1551 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:49,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 2207 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:26:49,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-08 06:26:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 390. [2025-03-08 06:26:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3449197860962567) internal successors, (503), 389 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 503 transitions. [2025-03-08 06:26:49,011 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 503 transitions. Word has length 75 [2025-03-08 06:26:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:49,011 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 503 transitions. [2025-03-08 06:26:49,011 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-08 06:26:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 503 transitions. [2025-03-08 06:26:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:26:49,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:49,012 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-08 06:26:49,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:26:49,012 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-08 06:26:49,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1347341980, now seen corresponding path program 1 times [2025-03-08 06:26:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:49,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630812595] [2025-03-08 06:26:49,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:49,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:26:49,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:26:49,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:49,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:26:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630812595] [2025-03-08 06:26:49,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630812595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:49,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:49,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:49,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959577684] [2025-03-08 06:26:49,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:49,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:49,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:49,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:49,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:49,260 INFO L87 Difference]: Start difference. First operand 390 states and 503 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-08 06:26:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:49,882 INFO L93 Difference]: Finished difference Result 690 states and 911 transitions. [2025-03-08 06:26:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:26:49,882 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-08 06:26:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:49,884 INFO L225 Difference]: With dead ends: 690 [2025-03-08 06:26:49,884 INFO L226 Difference]: Without dead ends: 601 [2025-03-08 06:26:49,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-08 06:26:49,885 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 2221 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2221 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:49,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2221 Valid, 1785 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:26:49,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-08 06:26:49,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2025-03-08 06:26:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 389 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 502 transitions. [2025-03-08 06:26:49,891 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 502 transitions. Word has length 75 [2025-03-08 06:26:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:49,892 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 502 transitions. [2025-03-08 06:26:49,892 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-08 06:26:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 502 transitions. [2025-03-08 06:26:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:26:49,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:49,893 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-08 06:26:49,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:26:49,893 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-08 06:26:49,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:49,893 INFO L85 PathProgramCache]: Analyzing trace with hash -560428487, now seen corresponding path program 1 times [2025-03-08 06:26:49,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:49,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5376659] [2025-03-08 06:26:49,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:49,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:49,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:26:49,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:26:49,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:49,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:50,095 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-08 06:26:50,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:50,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5376659] [2025-03-08 06:26:50,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5376659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:50,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:50,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:50,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234608125] [2025-03-08 06:26:50,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:50,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:50,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:50,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:50,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:50,097 INFO L87 Difference]: Start difference. First operand 390 states and 502 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-08 06:26:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:50,744 INFO L93 Difference]: Finished difference Result 748 states and 978 transitions. [2025-03-08 06:26:50,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:26:50,745 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-08 06:26:50,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:50,747 INFO L225 Difference]: With dead ends: 748 [2025-03-08 06:26:50,747 INFO L226 Difference]: Without dead ends: 605 [2025-03-08 06:26:50,747 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-08 06:26:50,748 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 1999 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1999 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:50,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1999 Valid, 1681 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:26:50,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-08 06:26:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 390. [2025-03-08 06:26:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.339572192513369) internal successors, (501), 389 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 501 transitions. [2025-03-08 06:26:50,755 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 501 transitions. Word has length 77 [2025-03-08 06:26:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:50,755 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 501 transitions. [2025-03-08 06:26:50,755 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-08 06:26:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 501 transitions. [2025-03-08 06:26:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:26:50,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:50,756 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-08 06:26:50,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:26:50,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:26:50,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash 175908129, now seen corresponding path program 1 times [2025-03-08 06:26:50,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:50,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209604452] [2025-03-08 06:26:50,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:50,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:50,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:26:50,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:26:50,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:50,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:50,962 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-08 06:26:50,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:50,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209604452] [2025-03-08 06:26:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209604452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:50,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721711320] [2025-03-08 06:26:50,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:50,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:50,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:50,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:50,964 INFO L87 Difference]: Start difference. First operand 390 states and 501 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-08 06:26:51,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:51,452 INFO L93 Difference]: Finished difference Result 582 states and 740 transitions. [2025-03-08 06:26:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:26:51,452 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-08 06:26:51,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:51,454 INFO L225 Difference]: With dead ends: 582 [2025-03-08 06:26:51,454 INFO L226 Difference]: Without dead ends: 577 [2025-03-08 06:26:51,455 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-08 06:26:51,455 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 2052 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:51,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 1161 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:26:51,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2025-03-08 06:26:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 390. [2025-03-08 06:26:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3368983957219251) internal successors, (500), 389 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 500 transitions. [2025-03-08 06:26:51,461 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 500 transitions. Word has length 77 [2025-03-08 06:26:51,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:51,461 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 500 transitions. [2025-03-08 06:26:51,461 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-08 06:26:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 500 transitions. [2025-03-08 06:26:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:26:51,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:51,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, 1, 1] [2025-03-08 06:26:51,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:26:51,462 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:26:51,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash 798025463, now seen corresponding path program 1 times [2025-03-08 06:26:51,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:51,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065761758] [2025-03-08 06:26:51,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:51,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:51,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:26:51,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:26:51,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:51,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:51,751 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-08 06:26:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:51,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065761758] [2025-03-08 06:26:51,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065761758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:51,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:51,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:51,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222348964] [2025-03-08 06:26:51,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:51,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:51,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:51,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:51,752 INFO L87 Difference]: Start difference. First operand 390 states and 500 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-08 06:26:52,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:52,427 INFO L93 Difference]: Finished difference Result 699 states and 915 transitions. [2025-03-08 06:26:52,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:26:52,427 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-08 06:26:52,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:52,430 INFO L225 Difference]: With dead ends: 699 [2025-03-08 06:26:52,430 INFO L226 Difference]: Without dead ends: 601 [2025-03-08 06:26:52,430 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-08 06:26:52,431 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 2030 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2030 SdHoareTripleChecker+Valid, 2199 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:52,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2030 Valid, 2199 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:26:52,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-08 06:26:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 390. [2025-03-08 06:26:52,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 374 states have (on average 1.3342245989304813) internal successors, (499), 389 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:52,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 499 transitions. [2025-03-08 06:26:52,443 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 499 transitions. Word has length 77 [2025-03-08 06:26:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:52,444 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 499 transitions. [2025-03-08 06:26:52,444 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-08 06:26:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 499 transitions. [2025-03-08 06:26:52,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:26:52,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:52,445 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-08 06:26:52,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:26:52,445 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:26:52,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash 889581907, now seen corresponding path program 1 times [2025-03-08 06:26:52,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:52,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982803620] [2025-03-08 06:26:52,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:52,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:52,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:26:52,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:26:52,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:52,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:52,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-08 06:26:52,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:52,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982803620] [2025-03-08 06:26:52,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982803620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:52,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:52,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:26:52,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029953751] [2025-03-08 06:26:52,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:52,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:26:52,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:52,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:26:52,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:26:52,830 INFO L87 Difference]: Start difference. First operand 390 states and 499 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-08 06:26:53,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:53,958 INFO L93 Difference]: Finished difference Result 941 states and 1272 transitions. [2025-03-08 06:26:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:26:53,958 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-08 06:26:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:53,961 INFO L225 Difference]: With dead ends: 941 [2025-03-08 06:26:53,961 INFO L226 Difference]: Without dead ends: 843 [2025-03-08 06:26:53,962 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-08 06:26:53,962 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 3573 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3573 SdHoareTripleChecker+Valid, 2916 SdHoareTripleChecker+Invalid, 2598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:53,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3573 Valid, 2916 Invalid, 2598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:26:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-08 06:26:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 394. [2025-03-08 06:26:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3306878306878307) internal successors, (503), 393 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 503 transitions. [2025-03-08 06:26:53,970 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 503 transitions. Word has length 77 [2025-03-08 06:26:53,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:53,970 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 503 transitions. [2025-03-08 06:26:53,970 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-08 06:26:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 503 transitions. [2025-03-08 06:26:53,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:26:53,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:53,971 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-08 06:26:53,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:26:53,971 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:26:53,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1136179180, now seen corresponding path program 1 times [2025-03-08 06:26:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:53,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524435822] [2025-03-08 06:26:53,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:53,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:26:53,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:26:54,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:54,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:54,175 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-08 06:26:54,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:54,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524435822] [2025-03-08 06:26:54,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524435822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:54,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:54,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351362370] [2025-03-08 06:26:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:54,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:54,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:54,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:54,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:54,177 INFO L87 Difference]: Start difference. First operand 394 states and 503 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-08 06:26:54,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:54,749 INFO L93 Difference]: Finished difference Result 673 states and 876 transitions. [2025-03-08 06:26:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:26:54,749 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-08 06:26:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:54,751 INFO L225 Difference]: With dead ends: 673 [2025-03-08 06:26:54,751 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 06:26:54,751 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-08 06:26:54,752 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 1727 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:54,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 1710 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:26:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 06:26:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 394. [2025-03-08 06:26:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3280423280423281) internal successors, (502), 393 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 502 transitions. [2025-03-08 06:26:54,757 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 502 transitions. Word has length 77 [2025-03-08 06:26:54,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:54,757 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 502 transitions. [2025-03-08 06:26:54,758 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-08 06:26:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2025-03-08 06:26:54,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:26:54,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:54,758 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-08 06:26:54,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:26:54,759 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:26:54,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:54,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1482585862, now seen corresponding path program 1 times [2025-03-08 06:26:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:54,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621263299] [2025-03-08 06:26:54,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:54,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:26:54,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:26:54,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:54,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:55,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:26:55,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:55,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621263299] [2025-03-08 06:26:55,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621263299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:55,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:55,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:26:55,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628712546] [2025-03-08 06:26:55,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:55,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:26:55,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:55,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:26:55,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:26:55,074 INFO L87 Difference]: Start difference. First operand 394 states and 502 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-08 06:26:55,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:55,969 INFO L93 Difference]: Finished difference Result 875 states and 1170 transitions. [2025-03-08 06:26:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:26:55,970 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-08 06:26:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:55,972 INFO L225 Difference]: With dead ends: 875 [2025-03-08 06:26:55,972 INFO L226 Difference]: Without dead ends: 799 [2025-03-08 06:26:55,973 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-08 06:26:55,973 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 4182 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4182 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:55,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4182 Valid, 1506 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:26:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-08 06:26:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 398. [2025-03-08 06:26:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.324607329842932) internal successors, (506), 397 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 506 transitions. [2025-03-08 06:26:55,978 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 506 transitions. Word has length 77 [2025-03-08 06:26:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:55,978 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 506 transitions. [2025-03-08 06:26:55,979 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-08 06:26:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 506 transitions. [2025-03-08 06:26:55,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:26:55,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:55,979 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-08 06:26:55,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:26:55,980 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:26:55,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash 648132248, now seen corresponding path program 1 times [2025-03-08 06:26:55,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:55,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397577503] [2025-03-08 06:26:55,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:55,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:55,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:26:56,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:26:56,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:56,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:56,171 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-08 06:26:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:56,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397577503] [2025-03-08 06:26:56,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397577503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:56,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:56,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:56,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086724653] [2025-03-08 06:26:56,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:56,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:56,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:56,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:56,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:56,172 INFO L87 Difference]: Start difference. First operand 398 states and 506 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-08 06:26:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:56,753 INFO L93 Difference]: Finished difference Result 669 states and 870 transitions. [2025-03-08 06:26:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:26:56,753 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-08 06:26:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:56,755 INFO L225 Difference]: With dead ends: 669 [2025-03-08 06:26:56,755 INFO L226 Difference]: Without dead ends: 597 [2025-03-08 06:26:56,756 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-08 06:26:56,756 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 2626 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2626 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:56,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2626 Valid, 1355 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:26:56,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-08 06:26:56,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 398. [2025-03-08 06:26:56,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.3219895287958114) internal successors, (505), 397 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:56,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 505 transitions. [2025-03-08 06:26:56,762 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 505 transitions. Word has length 77 [2025-03-08 06:26:56,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:56,763 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 505 transitions. [2025-03-08 06:26:56,763 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-08 06:26:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 505 transitions. [2025-03-08 06:26:56,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:26:56,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:56,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:26:56,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:26:56,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:26:56,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2114497927, now seen corresponding path program 1 times [2025-03-08 06:26:56,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:56,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15654382] [2025-03-08 06:26:56,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:56,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:56,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:26:56,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:26:56,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:56,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:56,929 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-08 06:26:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:56,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15654382] [2025-03-08 06:26:56,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15654382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:56,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:56,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896379673] [2025-03-08 06:26:56,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:56,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:56,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:56,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:56,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:56,932 INFO L87 Difference]: Start difference. First operand 398 states and 505 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-08 06:26:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:57,431 INFO L93 Difference]: Finished difference Result 590 states and 743 transitions. [2025-03-08 06:26:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:26:57,431 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-08 06:26:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:57,432 INFO L225 Difference]: With dead ends: 590 [2025-03-08 06:26:57,432 INFO L226 Difference]: Without dead ends: 585 [2025-03-08 06:26:57,433 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-08 06:26:57,433 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1980 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:57,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 1217 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:26:57,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-08 06:26:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 398. [2025-03-08 06:26:57,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.3193717277486912) internal successors, (504), 397 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:57,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 504 transitions. [2025-03-08 06:26:57,438 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 504 transitions. Word has length 78 [2025-03-08 06:26:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:57,438 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 504 transitions. [2025-03-08 06:26:57,439 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-08 06:26:57,439 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 504 transitions. [2025-03-08 06:26:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:26:57,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:57,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] [2025-03-08 06:26:57,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:26:57,440 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:26:57,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:57,440 INFO L85 PathProgramCache]: Analyzing trace with hash 488613511, now seen corresponding path program 1 times [2025-03-08 06:26:57,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:57,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120262710] [2025-03-08 06:26:57,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:57,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:26:57,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:26:57,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:57,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:57,623 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-08 06:26:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120262710] [2025-03-08 06:26:57,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120262710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:57,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:57,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:57,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74108770] [2025-03-08 06:26:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:57,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:57,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:57,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:57,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:57,624 INFO L87 Difference]: Start difference. First operand 398 states and 504 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-08 06:26:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:58,187 INFO L93 Difference]: Finished difference Result 703 states and 915 transitions. [2025-03-08 06:26:58,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:26:58,188 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-08 06:26:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:58,189 INFO L225 Difference]: With dead ends: 703 [2025-03-08 06:26:58,189 INFO L226 Difference]: Without dead ends: 605 [2025-03-08 06:26:58,190 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-08 06:26:58,190 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 1510 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:58,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1831 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:26:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-08 06:26:58,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 394. [2025-03-08 06:26:58,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.32010582010582) internal successors, (499), 393 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:58,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 499 transitions. [2025-03-08 06:26:58,195 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 499 transitions. Word has length 78 [2025-03-08 06:26:58,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:58,195 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 499 transitions. [2025-03-08 06:26:58,195 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-08 06:26:58,195 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 499 transitions. [2025-03-08 06:26:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:26:58,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:58,196 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-08 06:26:58,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:26:58,196 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-08 06:26:58,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1269269000, now seen corresponding path program 1 times [2025-03-08 06:26:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006685212] [2025-03-08 06:26:58,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:58,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:26:58,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:26:58,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:58,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:58,343 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-08 06:26:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006685212] [2025-03-08 06:26:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006685212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:58,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541170881] [2025-03-08 06:26:58,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:58,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:58,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:58,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:58,344 INFO L87 Difference]: Start difference. First operand 394 states and 499 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-08 06:26:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:58,885 INFO L93 Difference]: Finished difference Result 709 states and 919 transitions. [2025-03-08 06:26:58,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:26:58,885 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-08 06:26:58,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:58,887 INFO L225 Difference]: With dead ends: 709 [2025-03-08 06:26:58,887 INFO L226 Difference]: Without dead ends: 605 [2025-03-08 06:26:58,887 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-08 06:26:58,887 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 1507 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:58,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1831 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:26:58,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-08 06:26:58,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 394. [2025-03-08 06:26:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3174603174603174) internal successors, (498), 393 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 498 transitions. [2025-03-08 06:26:58,892 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 498 transitions. Word has length 79 [2025-03-08 06:26:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:58,892 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 498 transitions. [2025-03-08 06:26:58,892 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-08 06:26:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 498 transitions. [2025-03-08 06:26:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:26:58,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:58,893 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-08 06:26:58,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:26:58,893 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-08 06:26:58,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:58,893 INFO L85 PathProgramCache]: Analyzing trace with hash -210877462, now seen corresponding path program 1 times [2025-03-08 06:26:58,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:58,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111383310] [2025-03-08 06:26:58,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:58,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:26:58,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:26:58,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:58,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:59,039 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-08 06:26:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:59,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111383310] [2025-03-08 06:26:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111383310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:59,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:59,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:59,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353332307] [2025-03-08 06:26:59,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:59,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:59,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:59,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:59,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:59,041 INFO L87 Difference]: Start difference. First operand 394 states and 498 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-08 06:26:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:26:59,494 INFO L93 Difference]: Finished difference Result 674 states and 869 transitions. [2025-03-08 06:26:59,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:26:59,494 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-08 06:26:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:26:59,495 INFO L225 Difference]: With dead ends: 674 [2025-03-08 06:26:59,496 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 06:26:59,496 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-08 06:26:59,496 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 1144 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:26:59,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 1583 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:26:59,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 06:26:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 394. [2025-03-08 06:26:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3148148148148149) internal successors, (497), 393 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:26:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2025-03-08 06:26:59,500 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 79 [2025-03-08 06:26:59,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:26:59,500 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2025-03-08 06:26:59,500 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-08 06:26:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2025-03-08 06:26:59,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:26:59,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:26:59,501 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-08 06:26:59,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:26:59,501 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-08 06:26:59,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:26:59,501 INFO L85 PathProgramCache]: Analyzing trace with hash -907101364, now seen corresponding path program 1 times [2025-03-08 06:26:59,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:26:59,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206233903] [2025-03-08 06:26:59,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:26:59,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:26:59,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:26:59,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:26:59,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:26:59,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:26:59,643 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-08 06:26:59,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:26:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206233903] [2025-03-08 06:26:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206233903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:26:59,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:26:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:26:59,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467121815] [2025-03-08 06:26:59,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:26:59,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:26:59,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:26:59,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:26:59,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:26:59,645 INFO L87 Difference]: Start difference. First operand 394 states and 497 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-08 06:27:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:00,081 INFO L93 Difference]: Finished difference Result 650 states and 830 transitions. [2025-03-08 06:27:00,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:00,081 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-08 06:27:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:00,083 INFO L225 Difference]: With dead ends: 650 [2025-03-08 06:27:00,083 INFO L226 Difference]: Without dead ends: 581 [2025-03-08 06:27:00,083 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-08 06:27:00,084 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 1753 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:00,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 1423 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-08 06:27:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 394. [2025-03-08 06:27:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.312169312169312) internal successors, (496), 393 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 496 transitions. [2025-03-08 06:27:00,088 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 496 transitions. Word has length 79 [2025-03-08 06:27:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:00,088 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 496 transitions. [2025-03-08 06:27:00,088 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-08 06:27:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 496 transitions. [2025-03-08 06:27:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:27:00,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:00,089 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-08 06:27:00,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:27:00,089 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-08 06:27:00,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:00,090 INFO L85 PathProgramCache]: Analyzing trace with hash 204131349, now seen corresponding path program 1 times [2025-03-08 06:27:00,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:00,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146689172] [2025-03-08 06:27:00,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:00,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:00,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:27:00,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:27:00,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:00,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:00,251 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-08 06:27:00,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146689172] [2025-03-08 06:27:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146689172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:00,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:00,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137102974] [2025-03-08 06:27:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:00,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:00,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:00,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:00,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:00,254 INFO L87 Difference]: Start difference. First operand 394 states and 496 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-08 06:27:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:00,714 INFO L93 Difference]: Finished difference Result 610 states and 771 transitions. [2025-03-08 06:27:00,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:00,715 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-08 06:27:00,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:00,716 INFO L225 Difference]: With dead ends: 610 [2025-03-08 06:27:00,716 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 06:27:00,716 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-08 06:27:00,717 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 2069 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 1574 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:00,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 1574 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 06:27:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 394. [2025-03-08 06:27:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3095238095238095) internal successors, (495), 393 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:00,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 495 transitions. [2025-03-08 06:27:00,721 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 495 transitions. Word has length 79 [2025-03-08 06:27:00,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:00,721 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 495 transitions. [2025-03-08 06:27:00,721 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-08 06:27:00,721 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 495 transitions. [2025-03-08 06:27:00,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:27:00,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:00,722 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-08 06:27:00,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:27:00,722 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-08 06:27:00,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash -492092553, now seen corresponding path program 1 times [2025-03-08 06:27:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:00,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814603396] [2025-03-08 06:27:00,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:00,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:00,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:27:00,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:27:00,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:00,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:00,851 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-08 06:27:00,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:00,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814603396] [2025-03-08 06:27:00,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814603396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:00,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:00,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:00,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805267080] [2025-03-08 06:27:00,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:00,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:00,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:00,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:00,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:00,853 INFO L87 Difference]: Start difference. First operand 394 states and 495 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-08 06:27:01,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:01,242 INFO L93 Difference]: Finished difference Result 586 states and 732 transitions. [2025-03-08 06:27:01,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:01,243 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-08 06:27:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:01,244 INFO L225 Difference]: With dead ends: 586 [2025-03-08 06:27:01,244 INFO L226 Difference]: Without dead ends: 581 [2025-03-08 06:27:01,245 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-08 06:27:01,246 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 1880 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1880 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:01,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1880 Valid, 1320 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:27:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-08 06:27:01,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 394. [2025-03-08 06:27:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.306878306878307) internal successors, (494), 393 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 494 transitions. [2025-03-08 06:27:01,249 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 494 transitions. Word has length 79 [2025-03-08 06:27:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:01,250 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 494 transitions. [2025-03-08 06:27:01,250 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-08 06:27:01,250 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 494 transitions. [2025-03-08 06:27:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:27:01,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:01,250 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-08 06:27:01,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:27:01,250 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-08 06:27:01,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash 898577989, now seen corresponding path program 1 times [2025-03-08 06:27:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:01,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324555882] [2025-03-08 06:27:01,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:01,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:27:01,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:27:01,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:01,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:01,418 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-08 06:27:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:01,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324555882] [2025-03-08 06:27:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324555882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:01,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:01,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193417035] [2025-03-08 06:27:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:01,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:01,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:01,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:01,419 INFO L87 Difference]: Start difference. First operand 394 states and 494 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-08 06:27:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:01,873 INFO L93 Difference]: Finished difference Result 669 states and 857 transitions. [2025-03-08 06:27:01,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:01,874 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-08 06:27:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:01,875 INFO L225 Difference]: With dead ends: 669 [2025-03-08 06:27:01,875 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 06:27:01,875 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-08 06:27:01,876 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 2319 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:01,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 1583 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 06:27:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 394. [2025-03-08 06:27:01,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3042328042328042) internal successors, (493), 393 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 493 transitions. [2025-03-08 06:27:01,879 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 493 transitions. Word has length 79 [2025-03-08 06:27:01,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:01,879 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 493 transitions. [2025-03-08 06:27:01,880 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-08 06:27:01,880 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 493 transitions. [2025-03-08 06:27:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:27:01,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:01,880 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-08 06:27:01,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:27:01,880 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:01,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1706807715, now seen corresponding path program 1 times [2025-03-08 06:27:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:01,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021769154] [2025-03-08 06:27:01,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:01,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:27:01,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:27:01,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:01,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:02,026 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-08 06:27:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021769154] [2025-03-08 06:27:02,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021769154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:02,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:02,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:02,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272788074] [2025-03-08 06:27:02,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:02,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:02,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:02,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:02,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:02,028 INFO L87 Difference]: Start difference. First operand 394 states and 493 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-08 06:27:02,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:02,444 INFO L93 Difference]: Finished difference Result 647 states and 823 transitions. [2025-03-08 06:27:02,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:02,445 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-08 06:27:02,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:02,446 INFO L225 Difference]: With dead ends: 647 [2025-03-08 06:27:02,446 INFO L226 Difference]: Without dead ends: 581 [2025-03-08 06:27:02,446 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-08 06:27:02,447 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 2062 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:02,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 1528 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:27:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-08 06:27:02,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 394. [2025-03-08 06:27:02,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3015873015873016) internal successors, (492), 393 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 492 transitions. [2025-03-08 06:27:02,450 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 492 transitions. Word has length 79 [2025-03-08 06:27:02,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:02,451 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 492 transitions. [2025-03-08 06:27:02,451 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-08 06:27:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 492 transitions. [2025-03-08 06:27:02,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:27:02,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:02,451 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-08 06:27:02,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:27:02,451 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-08 06:27:02,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1241546157, now seen corresponding path program 1 times [2025-03-08 06:27:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:02,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568759334] [2025-03-08 06:27:02,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:02,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:27:02,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:27:02,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:02,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:02,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-08 06:27:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568759334] [2025-03-08 06:27:02,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568759334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:02,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:02,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:02,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033181228] [2025-03-08 06:27:02,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:02,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:02,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:02,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:02,717 INFO L87 Difference]: Start difference. First operand 394 states and 492 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-08 06:27:03,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:03,447 INFO L93 Difference]: Finished difference Result 812 states and 1061 transitions. [2025-03-08 06:27:03,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:03,447 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-08 06:27:03,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:03,449 INFO L225 Difference]: With dead ends: 812 [2025-03-08 06:27:03,449 INFO L226 Difference]: Without dead ends: 743 [2025-03-08 06:27:03,450 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-08 06:27:03,450 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 4828 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4828 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:03,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4828 Valid, 1693 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:27:03,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-03-08 06:27:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 398. [2025-03-08 06:27:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.2984293193717278) internal successors, (496), 397 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 496 transitions. [2025-03-08 06:27:03,459 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 496 transitions. Word has length 79 [2025-03-08 06:27:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:03,459 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 496 transitions. [2025-03-08 06:27:03,459 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-08 06:27:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 496 transitions. [2025-03-08 06:27:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:27:03,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:03,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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:03,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 06:27:03,460 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-08 06:27:03,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:03,460 INFO L85 PathProgramCache]: Analyzing trace with hash -879359090, now seen corresponding path program 1 times [2025-03-08 06:27:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700854236] [2025-03-08 06:27:03,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:03,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:27:03,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:27:03,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:03,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:03,631 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-08 06:27:03,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:03,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700854236] [2025-03-08 06:27:03,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700854236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:03,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:03,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:03,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303806307] [2025-03-08 06:27:03,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:03,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:03,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:03,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:03,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:03,633 INFO L87 Difference]: Start difference. First operand 398 states and 496 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-08 06:27:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:04,081 INFO L93 Difference]: Finished difference Result 647 states and 821 transitions. [2025-03-08 06:27:04,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:04,081 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-08 06:27:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:04,083 INFO L225 Difference]: With dead ends: 647 [2025-03-08 06:27:04,083 INFO L226 Difference]: Without dead ends: 581 [2025-03-08 06:27:04,083 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-08 06:27:04,083 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 2172 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2172 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:04,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2172 Valid, 1625 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-03-08 06:27:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 398. [2025-03-08 06:27:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.2958115183246073) internal successors, (495), 397 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 495 transitions. [2025-03-08 06:27:04,087 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 495 transitions. Word has length 79 [2025-03-08 06:27:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:04,087 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 495 transitions. [2025-03-08 06:27:04,087 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-08 06:27:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 495 transitions. [2025-03-08 06:27:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:27:04,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:04,088 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-08 06:27:04,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 06:27:04,088 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-08 06:27:04,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:04,088 INFO L85 PathProgramCache]: Analyzing trace with hash 596264093, now seen corresponding path program 1 times [2025-03-08 06:27:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:04,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936669454] [2025-03-08 06:27:04,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:04,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:27:04,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:27:04,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:04,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:04,320 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-08 06:27:04,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:04,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936669454] [2025-03-08 06:27:04,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936669454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:04,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:04,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:04,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973970056] [2025-03-08 06:27:04,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:04,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:04,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:04,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:04,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:04,322 INFO L87 Difference]: Start difference. First operand 398 states and 495 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-08 06:27:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:05,102 INFO L93 Difference]: Finished difference Result 880 states and 1160 transitions. [2025-03-08 06:27:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:05,102 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-08 06:27:05,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:05,104 INFO L225 Difference]: With dead ends: 880 [2025-03-08 06:27:05,104 INFO L226 Difference]: Without dead ends: 799 [2025-03-08 06:27:05,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:27:05,104 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 3250 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3250 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 1584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:05,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3250 Valid, 1883 Invalid, 1584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 06:27:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-03-08 06:27:05,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 402. [2025-03-08 06:27:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2927461139896372) internal successors, (499), 401 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 499 transitions. [2025-03-08 06:27:05,108 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 499 transitions. Word has length 79 [2025-03-08 06:27:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:05,109 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 499 transitions. [2025-03-08 06:27:05,109 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-08 06:27:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 499 transitions. [2025-03-08 06:27:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:27:05,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:05,109 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-08 06:27:05,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 06:27:05,110 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-08 06:27:05,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1124756673, now seen corresponding path program 1 times [2025-03-08 06:27:05,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:05,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683585322] [2025-03-08 06:27:05,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:05,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:05,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:27:05,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:27:05,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:05,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:05,259 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-08 06:27:05,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:05,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683585322] [2025-03-08 06:27:05,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683585322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:05,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:05,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:05,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327771920] [2025-03-08 06:27:05,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:05,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:05,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:05,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:05,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:05,261 INFO L87 Difference]: Start difference. First operand 402 states and 499 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-08 06:27:05,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:05,714 INFO L93 Difference]: Finished difference Result 654 states and 827 transitions. [2025-03-08 06:27:05,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:05,715 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-08 06:27:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:05,716 INFO L225 Difference]: With dead ends: 654 [2025-03-08 06:27:05,716 INFO L226 Difference]: Without dead ends: 585 [2025-03-08 06:27:05,717 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-08 06:27:05,717 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 2137 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:05,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 1342 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-08 06:27:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 402. [2025-03-08 06:27:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2901554404145077) internal successors, (498), 401 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 498 transitions. [2025-03-08 06:27:05,721 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 498 transitions. Word has length 79 [2025-03-08 06:27:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:05,722 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 498 transitions. [2025-03-08 06:27:05,722 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-08 06:27:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 498 transitions. [2025-03-08 06:27:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:27:05,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:05,722 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-08 06:27:05,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:27:05,723 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:05,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:05,723 INFO L85 PathProgramCache]: Analyzing trace with hash -180085630, now seen corresponding path program 1 times [2025-03-08 06:27:05,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:05,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180007884] [2025-03-08 06:27:05,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:05,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:05,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:27:05,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:27:05,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:05,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:05,878 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-08 06:27:05,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:05,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180007884] [2025-03-08 06:27:05,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180007884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:05,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:05,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:05,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855830063] [2025-03-08 06:27:05,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:05,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:05,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:05,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:05,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:05,880 INFO L87 Difference]: Start difference. First operand 402 states and 498 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-08 06:27:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:06,469 INFO L93 Difference]: Finished difference Result 651 states and 823 transitions. [2025-03-08 06:27:06,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:06,469 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-08 06:27:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:06,470 INFO L225 Difference]: With dead ends: 651 [2025-03-08 06:27:06,470 INFO L226 Difference]: Without dead ends: 585 [2025-03-08 06:27:06,471 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-08 06:27:06,471 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 2081 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2081 SdHoareTripleChecker+Valid, 1815 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:06,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2081 Valid, 1815 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:27:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-08 06:27:06,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 402. [2025-03-08 06:27:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2875647668393781) internal successors, (497), 401 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:06,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 497 transitions. [2025-03-08 06:27:06,479 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 497 transitions. Word has length 79 [2025-03-08 06:27:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:06,479 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 497 transitions. [2025-03-08 06:27:06,480 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-08 06:27:06,480 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 497 transitions. [2025-03-08 06:27:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-08 06:27:06,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:06,480 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-08 06:27:06,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:27:06,480 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-08 06:27:06,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:06,481 INFO L85 PathProgramCache]: Analyzing trace with hash 283416907, now seen corresponding path program 1 times [2025-03-08 06:27:06,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:06,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601207237] [2025-03-08 06:27:06,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:06,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:06,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-08 06:27:06,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-08 06:27:06,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:06,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:06,610 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-08 06:27:06,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:06,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601207237] [2025-03-08 06:27:06,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601207237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:06,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:06,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300664863] [2025-03-08 06:27:06,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:06,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:06,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:06,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:06,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:06,612 INFO L87 Difference]: Start difference. First operand 402 states and 497 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-08 06:27:07,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:07,068 INFO L93 Difference]: Finished difference Result 651 states and 822 transitions. [2025-03-08 06:27:07,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:07,068 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-08 06:27:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:07,070 INFO L225 Difference]: With dead ends: 651 [2025-03-08 06:27:07,070 INFO L226 Difference]: Without dead ends: 585 [2025-03-08 06:27:07,070 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-08 06:27:07,070 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1817 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:07,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 1321 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-08 06:27:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 402. [2025-03-08 06:27:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 386 states have (on average 1.2849740932642486) internal successors, (496), 401 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 496 transitions. [2025-03-08 06:27:07,074 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 496 transitions. Word has length 79 [2025-03-08 06:27:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:07,075 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 496 transitions. [2025-03-08 06:27:07,075 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-08 06:27:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 496 transitions. [2025-03-08 06:27:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:27:07,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:07,075 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-08 06:27:07,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 06:27:07,076 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:07,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash -900750487, now seen corresponding path program 1 times [2025-03-08 06:27:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:07,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814434204] [2025-03-08 06:27:07,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:07,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:27:07,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:27:07,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:07,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:07,207 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-08 06:27:07,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:07,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814434204] [2025-03-08 06:27:07,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814434204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:07,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:07,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:07,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680390720] [2025-03-08 06:27:07,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:07,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:07,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:07,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:07,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:07,208 INFO L87 Difference]: Start difference. First operand 402 states and 496 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-08 06:27:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:07,642 INFO L93 Difference]: Finished difference Result 654 states and 823 transitions. [2025-03-08 06:27:07,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:07,642 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-08 06:27:07,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:07,643 INFO L225 Difference]: With dead ends: 654 [2025-03-08 06:27:07,643 INFO L226 Difference]: Without dead ends: 585 [2025-03-08 06:27:07,644 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-08 06:27:07,644 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 1690 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:07,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 1630 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:07,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-08 06:27:07,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 398. [2025-03-08 06:27:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 382 states have (on average 1.2853403141361257) internal successors, (491), 397 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 491 transitions. [2025-03-08 06:27:07,647 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 491 transitions. Word has length 80 [2025-03-08 06:27:07,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:07,648 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 491 transitions. [2025-03-08 06:27:07,648 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-08 06:27:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 491 transitions. [2025-03-08 06:27:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:27:07,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:07,648 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-08 06:27:07,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 06:27:07,648 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:07,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:07,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1482451450, now seen corresponding path program 1 times [2025-03-08 06:27:07,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:07,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13553398] [2025-03-08 06:27:07,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:07,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:07,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:27:07,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:27:07,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:07,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:07,773 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-08 06:27:07,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13553398] [2025-03-08 06:27:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13553398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:07,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:07,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467024378] [2025-03-08 06:27:07,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:07,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:07,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:07,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:07,774 INFO L87 Difference]: Start difference. First operand 398 states and 491 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-08 06:27:08,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:08,221 INFO L93 Difference]: Finished difference Result 674 states and 853 transitions. [2025-03-08 06:27:08,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:08,225 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-08 06:27:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:08,226 INFO L225 Difference]: With dead ends: 674 [2025-03-08 06:27:08,226 INFO L226 Difference]: Without dead ends: 593 [2025-03-08 06:27:08,227 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-08 06:27:08,227 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 1121 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:08,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 1568 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:27:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-03-08 06:27:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 394. [2025-03-08 06:27:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.2857142857142858) internal successors, (486), 393 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 486 transitions. [2025-03-08 06:27:08,233 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 486 transitions. Word has length 80 [2025-03-08 06:27:08,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:08,234 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 486 transitions. [2025-03-08 06:27:08,234 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-08 06:27:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 486 transitions. [2025-03-08 06:27:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:27:08,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:08,235 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-08 06:27:08,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 06:27:08,235 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:08,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:08,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1108865040, now seen corresponding path program 1 times [2025-03-08 06:27:08,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:08,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752108626] [2025-03-08 06:27:08,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:08,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:27:08,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:27:08,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:08,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:08,389 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-08 06:27:08,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:08,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752108626] [2025-03-08 06:27:08,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752108626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:08,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:08,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384413399] [2025-03-08 06:27:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:08,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:08,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:08,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:08,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:08,391 INFO L87 Difference]: Start difference. First operand 394 states and 486 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-08 06:27:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:08,845 INFO L93 Difference]: Finished difference Result 645 states and 812 transitions. [2025-03-08 06:27:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:27:08,846 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-08 06:27:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:08,847 INFO L225 Difference]: With dead ends: 645 [2025-03-08 06:27:08,847 INFO L226 Difference]: Without dead ends: 580 [2025-03-08 06:27:08,847 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-08 06:27:08,848 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 2119 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 1162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:08,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 1693 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1162 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:08,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-08 06:27:08,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-08 06:27:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2838196286472148) internal successors, (484), 392 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-08 06:27:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 484 transitions. [2025-03-08 06:27:08,851 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 484 transitions. Word has length 80 [2025-03-08 06:27:08,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:08,851 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 484 transitions. [2025-03-08 06:27:08,851 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-08 06:27:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 484 transitions. [2025-03-08 06:27:08,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 06:27:08,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:08,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:08,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 06:27:08,852 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-08 06:27:08,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:08,853 INFO L85 PathProgramCache]: Analyzing trace with hash -442132880, now seen corresponding path program 1 times [2025-03-08 06:27:08,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:08,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583606509] [2025-03-08 06:27:08,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:08,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:08,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 06:27:08,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 06:27:08,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:08,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:09,034 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-08 06:27:09,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:09,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583606509] [2025-03-08 06:27:09,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583606509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:09,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:09,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643661041] [2025-03-08 06:27:09,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:09,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:09,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:09,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:09,036 INFO L87 Difference]: Start difference. First operand 393 states and 484 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-08 06:27:09,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:09,508 INFO L93 Difference]: Finished difference Result 668 states and 844 transitions. [2025-03-08 06:27:09,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:09,508 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-08 06:27:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:09,510 INFO L225 Difference]: With dead ends: 668 [2025-03-08 06:27:09,510 INFO L226 Difference]: Without dead ends: 592 [2025-03-08 06:27:09,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:27:09,510 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 2002 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2002 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:09,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2002 Valid, 1754 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:27:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-08 06:27:09,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2025-03-08 06:27:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.2841823056300268) internal successors, (479), 388 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 479 transitions. [2025-03-08 06:27:09,514 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 479 transitions. Word has length 80 [2025-03-08 06:27:09,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:09,514 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 479 transitions. [2025-03-08 06:27:09,514 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-08 06:27:09,514 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 479 transitions. [2025-03-08 06:27:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:27:09,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:09,515 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-08 06:27:09,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 06:27:09,515 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:09,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:09,515 INFO L85 PathProgramCache]: Analyzing trace with hash 961250031, now seen corresponding path program 1 times [2025-03-08 06:27:09,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:09,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681859089] [2025-03-08 06:27:09,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:09,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:09,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:27:09,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:27:09,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:09,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:09,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-08 06:27:09,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:09,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681859089] [2025-03-08 06:27:09,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681859089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:09,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:09,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:27:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150087812] [2025-03-08 06:27:09,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:09,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:27:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:09,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:27:09,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:27:09,909 INFO L87 Difference]: Start difference. First operand 389 states and 479 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 06:27:10,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:10,517 INFO L93 Difference]: Finished difference Result 955 states and 1208 transitions. [2025-03-08 06:27:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:27:10,517 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 06:27:10,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:10,519 INFO L225 Difference]: With dead ends: 955 [2025-03-08 06:27:10,519 INFO L226 Difference]: Without dead ends: 875 [2025-03-08 06:27:10,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:27:10,520 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 2909 mSDsluCounter, 3344 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 4086 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:10,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 4086 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:27:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-08 06:27:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 373. [2025-03-08 06:27:10,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 359 states have (on average 1.2813370473537604) internal successors, (460), 372 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 460 transitions. [2025-03-08 06:27:10,523 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 460 transitions. Word has length 81 [2025-03-08 06:27:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:10,523 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 460 transitions. [2025-03-08 06:27:10,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 06:27:10,524 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 460 transitions. [2025-03-08 06:27:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:27:10,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:10,524 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-08 06:27:10,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 06:27:10,524 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:10,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1019772130, now seen corresponding path program 1 times [2025-03-08 06:27:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:10,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379895151] [2025-03-08 06:27:10,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:10,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:27:10,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:27:10,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:10,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:10,913 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-08 06:27:10,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:10,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379895151] [2025-03-08 06:27:10,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379895151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:10,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:10,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:27:10,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2954642] [2025-03-08 06:27:10,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:10,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:10,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:10,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:10,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:10,914 INFO L87 Difference]: Start difference. First operand 373 states and 460 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-08 06:27:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:11,358 INFO L93 Difference]: Finished difference Result 597 states and 766 transitions. [2025-03-08 06:27:11,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:27:11,358 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-08 06:27:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:11,359 INFO L225 Difference]: With dead ends: 597 [2025-03-08 06:27:11,359 INFO L226 Difference]: Without dead ends: 500 [2025-03-08 06:27:11,359 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-08 06:27:11,360 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 1815 mSDsluCounter, 2795 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1815 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:11,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1815 Valid, 3268 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:11,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-03-08 06:27:11,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 340. [2025-03-08 06:27:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 329 states have (on average 1.2765957446808511) internal successors, (420), 339 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 420 transitions. [2025-03-08 06:27:11,363 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 420 transitions. Word has length 81 [2025-03-08 06:27:11,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:11,363 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 420 transitions. [2025-03-08 06:27:11,363 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-08 06:27:11,363 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 420 transitions. [2025-03-08 06:27:11,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:27:11,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:11,363 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-08 06:27:11,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 06:27:11,363 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:11,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:11,364 INFO L85 PathProgramCache]: Analyzing trace with hash 411224557, now seen corresponding path program 1 times [2025-03-08 06:27:11,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:11,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18584353] [2025-03-08 06:27:11,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:11,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:11,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:27:11,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:27:11,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:11,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:11,844 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-08 06:27:11,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:11,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18584353] [2025-03-08 06:27:11,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18584353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:11,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:11,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 06:27:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838551723] [2025-03-08 06:27:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:11,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 06:27:11,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:11,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 06:27:11,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:27:11,846 INFO L87 Difference]: Start difference. First operand 340 states and 420 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 06:27:12,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:12,318 INFO L93 Difference]: Finished difference Result 760 states and 995 transitions. [2025-03-08 06:27:12,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 06:27:12,318 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 06:27:12,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:12,320 INFO L225 Difference]: With dead ends: 760 [2025-03-08 06:27:12,320 INFO L226 Difference]: Without dead ends: 633 [2025-03-08 06:27:12,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:27:12,321 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 1852 mSDsluCounter, 3447 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1852 SdHoareTripleChecker+Valid, 4011 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:12,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1852 Valid, 4011 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-08 06:27:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 277. [2025-03-08 06:27:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 270 states have (on average 1.2777777777777777) internal successors, (345), 276 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2025-03-08 06:27:12,323 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 81 [2025-03-08 06:27:12,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:12,324 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2025-03-08 06:27:12,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 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-08 06:27:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2025-03-08 06:27:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:27:12,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:12,324 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-08 06:27:12,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 06:27:12,324 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:12,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1551497303, now seen corresponding path program 1 times [2025-03-08 06:27:12,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:12,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698715127] [2025-03-08 06:27:12,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:12,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:12,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:27:12,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:27:12,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:12,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:12,699 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-08 06:27:12,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:12,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698715127] [2025-03-08 06:27:12,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698715127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:12,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:12,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:27:12,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535699335] [2025-03-08 06:27:12,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:12,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:12,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:12,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:12,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:12,701 INFO L87 Difference]: Start difference. First operand 277 states and 345 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-08 06:27:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:13,092 INFO L93 Difference]: Finished difference Result 477 states and 620 transitions. [2025-03-08 06:27:13,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:27:13,092 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-08 06:27:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:13,093 INFO L225 Difference]: With dead ends: 477 [2025-03-08 06:27:13,093 INFO L226 Difference]: Without dead ends: 389 [2025-03-08 06:27:13,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:27:13,094 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 1241 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:13,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 2516 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-08 06:27:13,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 253. [2025-03-08 06:27:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 247 states have (on average 1.271255060728745) internal successors, (314), 252 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:13,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 314 transitions. [2025-03-08 06:27:13,097 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 314 transitions. Word has length 81 [2025-03-08 06:27:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:13,097 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 314 transitions. [2025-03-08 06:27:13,097 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-08 06:27:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 314 transitions. [2025-03-08 06:27:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:27:13,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:13,098 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-08 06:27:13,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 06:27:13,098 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:13,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash 578825661, now seen corresponding path program 1 times [2025-03-08 06:27:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:13,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048966605] [2025-03-08 06:27:13,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:13,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:13,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:27:13,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:27:13,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:13,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:13,383 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-08 06:27:13,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:13,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048966605] [2025-03-08 06:27:13,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048966605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:13,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:13,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:27:13,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530240139] [2025-03-08 06:27:13,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:13,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:13,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:13,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:13,384 INFO L87 Difference]: Start difference. First operand 253 states and 314 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-08 06:27:13,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:13,790 INFO L93 Difference]: Finished difference Result 436 states and 566 transitions. [2025-03-08 06:27:13,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:27:13,790 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-08 06:27:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:13,791 INFO L225 Difference]: With dead ends: 436 [2025-03-08 06:27:13,791 INFO L226 Difference]: Without dead ends: 368 [2025-03-08 06:27:13,791 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-08 06:27:13,792 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1681 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:13,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 1394 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-08 06:27:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 249. [2025-03-08 06:27:13,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 244 states have (on average 1.2663934426229508) internal successors, (309), 248 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 309 transitions. [2025-03-08 06:27:13,794 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 309 transitions. Word has length 81 [2025-03-08 06:27:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:13,794 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 309 transitions. [2025-03-08 06:27:13,794 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-08 06:27:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 309 transitions. [2025-03-08 06:27:13,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-08 06:27:13,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:13,795 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-08 06:27:13,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 06:27:13,795 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:13,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash 256522608, now seen corresponding path program 1 times [2025-03-08 06:27:13,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:13,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569210818] [2025-03-08 06:27:13,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:13,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 06:27:13,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 06:27:13,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:13,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:14,083 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-08 06:27:14,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:14,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569210818] [2025-03-08 06:27:14,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569210818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:14,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:14,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202449647] [2025-03-08 06:27:14,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:14,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:27:14,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:14,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:27:14,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:27:14,084 INFO L87 Difference]: Start difference. First operand 249 states and 309 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-08 06:27:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:14,342 INFO L93 Difference]: Finished difference Result 556 states and 746 transitions. [2025-03-08 06:27:14,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:14,342 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-08 06:27:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:14,343 INFO L225 Difference]: With dead ends: 556 [2025-03-08 06:27:14,343 INFO L226 Difference]: Without dead ends: 403 [2025-03-08 06:27:14,344 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-08 06:27:14,344 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 823 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:14,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1494 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:27:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-08 06:27:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 160. [2025-03-08 06:27:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 1.2531645569620253) internal successors, (198), 159 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:14,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 198 transitions. [2025-03-08 06:27:14,346 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 198 transitions. Word has length 81 [2025-03-08 06:27:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:14,346 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 198 transitions. [2025-03-08 06:27:14,346 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-08 06:27:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions. [2025-03-08 06:27:14,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-08 06:27:14,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:14,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, 1, 1, 1] [2025-03-08 06:27:14,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 06:27:14,346 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-08 06:27:14,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash 749468343, now seen corresponding path program 1 times [2025-03-08 06:27:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:14,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602249166] [2025-03-08 06:27:14,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:14,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:14,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 06:27:14,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 06:27:14,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:14,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:14,557 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-08 06:27:14,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:14,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602249166] [2025-03-08 06:27:14,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602249166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:14,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:14,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:27:14,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075626483] [2025-03-08 06:27:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:14,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:14,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:14,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:14,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:14,558 INFO L87 Difference]: Start difference. First operand 160 states and 198 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-08 06:27:14,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:14,985 INFO L93 Difference]: Finished difference Result 535 states and 735 transitions. [2025-03-08 06:27:14,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:27:14,985 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-08 06:27:14,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:14,986 INFO L225 Difference]: With dead ends: 535 [2025-03-08 06:27:14,986 INFO L226 Difference]: Without dead ends: 453 [2025-03-08 06:27:14,987 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-08 06:27:14,987 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 2341 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2341 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:14,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2341 Valid, 726 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-08 06:27:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 164. [2025-03-08 06:27:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.2469135802469136) internal successors, (202), 163 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2025-03-08 06:27:14,989 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 82 [2025-03-08 06:27:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:14,989 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2025-03-08 06:27:14,989 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-08 06:27:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2025-03-08 06:27:14,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 06:27:14,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:14,989 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-08 06:27:14,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 06:27:14,989 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:14,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:14,990 INFO L85 PathProgramCache]: Analyzing trace with hash -990103780, now seen corresponding path program 1 times [2025-03-08 06:27:14,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:14,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139229884] [2025-03-08 06:27:14,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:14,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:15,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 06:27:15,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 06:27:15,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:15,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:15,106 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-08 06:27:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:15,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139229884] [2025-03-08 06:27:15,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139229884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:15,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:15,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:27:15,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012671501] [2025-03-08 06:27:15,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:15,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:27:15,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:15,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:27:15,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:27:15,107 INFO L87 Difference]: Start difference. First operand 164 states and 202 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-08 06:27:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:15,332 INFO L93 Difference]: Finished difference Result 333 states and 438 transitions. [2025-03-08 06:27:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:27:15,332 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-08 06:27:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:15,333 INFO L225 Difference]: With dead ends: 333 [2025-03-08 06:27:15,333 INFO L226 Difference]: Without dead ends: 251 [2025-03-08 06:27:15,333 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-08 06:27:15,333 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 717 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:15,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 761 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:27:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-08 06:27:15,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 160. [2025-03-08 06:27:15,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 1.2468354430379747) internal successors, (197), 159 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:15,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 197 transitions. [2025-03-08 06:27:15,335 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 197 transitions. Word has length 83 [2025-03-08 06:27:15,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:15,335 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 197 transitions. [2025-03-08 06:27:15,335 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-08 06:27:15,335 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 197 transitions. [2025-03-08 06:27:15,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-08 06:27:15,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:15,335 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-08 06:27:15,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 06:27:15,335 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:15,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash 594222774, now seen corresponding path program 1 times [2025-03-08 06:27:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637797695] [2025-03-08 06:27:15,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:15,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-08 06:27:15,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-08 06:27:15,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:15,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:16,235 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-08 06:27:16,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:16,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637797695] [2025-03-08 06:27:16,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637797695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:16,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:16,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-08 06:27:16,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632854489] [2025-03-08 06:27:16,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:16,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 06:27:16,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:16,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 06:27:16,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:27:16,237 INFO L87 Difference]: Start difference. First operand 160 states and 197 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-08 06:27:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:18,356 INFO L93 Difference]: Finished difference Result 623 states and 833 transitions. [2025-03-08 06:27:18,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 06:27:18,356 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-08 06:27:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:18,358 INFO L225 Difference]: With dead ends: 623 [2025-03-08 06:27:18,358 INFO L226 Difference]: Without dead ends: 617 [2025-03-08 06:27:18,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 06:27:18,359 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 1760 mSDsluCounter, 6249 mSDsCounter, 0 mSdLazyCounter, 3493 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 6777 SdHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:18,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 6777 Invalid, 3506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3493 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:27:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-08 06:27:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 181. [2025-03-08 06:27:18,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 1.2458100558659218) internal successors, (223), 180 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 223 transitions. [2025-03-08 06:27:18,361 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 223 transitions. Word has length 84 [2025-03-08 06:27:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:18,361 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 223 transitions. [2025-03-08 06:27:18,361 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-08 06:27:18,362 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 223 transitions. [2025-03-08 06:27:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-08 06:27:18,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:18,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:18,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 06:27:18,362 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:18,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1654900724, now seen corresponding path program 1 times [2025-03-08 06:27:18,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:18,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597637065] [2025-03-08 06:27:18,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:18,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-08 06:27:18,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-08 06:27:18,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:18,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:18,630 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-08 06:27:18,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:18,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597637065] [2025-03-08 06:27:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597637065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:18,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:27:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186176643] [2025-03-08 06:27:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:18,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:27:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:18,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:27:18,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:27:18,632 INFO L87 Difference]: Start difference. First operand 181 states and 223 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-08 06:27:18,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:18,849 INFO L93 Difference]: Finished difference Result 258 states and 334 transitions. [2025-03-08 06:27:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:27:18,849 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-08 06:27:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:18,850 INFO L225 Difference]: With dead ends: 258 [2025-03-08 06:27:18,850 INFO L226 Difference]: Without dead ends: 252 [2025-03-08 06:27:18,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:27:18,850 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 433 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:18,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1444 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:27:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-08 06:27:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 154. [2025-03-08 06:27:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.2483660130718954) internal successors, (191), 153 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:18,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 191 transitions. [2025-03-08 06:27:18,852 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 191 transitions. Word has length 85 [2025-03-08 06:27:18,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:18,852 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 191 transitions. [2025-03-08 06:27:18,852 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-08 06:27:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 191 transitions. [2025-03-08 06:27:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 06:27:18,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:18,852 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:27:18,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-08 06:27:18,853 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:18,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:18,853 INFO L85 PathProgramCache]: Analyzing trace with hash 208015276, now seen corresponding path program 1 times [2025-03-08 06:27:18,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:18,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256100806] [2025-03-08 06:27:18,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:18,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:18,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-08 06:27:18,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-08 06:27:18,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:18,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:18,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-08 06:27:18,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:18,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256100806] [2025-03-08 06:27:18,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256100806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:18,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:18,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:27:18,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607770700] [2025-03-08 06:27:18,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:18,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:27:18,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:18,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:27:18,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:27:18,936 INFO L87 Difference]: Start difference. First operand 154 states and 191 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-08 06:27:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:19,035 INFO L93 Difference]: Finished difference Result 794 states and 1141 transitions. [2025-03-08 06:27:19,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 06:27:19,036 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-08 06:27:19,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:19,037 INFO L225 Difference]: With dead ends: 794 [2025-03-08 06:27:19,037 INFO L226 Difference]: Without dead ends: 730 [2025-03-08 06:27:19,038 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-08 06:27:19,038 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 1246 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1837 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-08 06:27:19,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1837 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:27:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-08 06:27:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 216. [2025-03-08 06:27:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 1.3162790697674418) internal successors, (283), 215 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2025-03-08 06:27:19,042 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 283 transitions. Word has length 111 [2025-03-08 06:27:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:19,042 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 283 transitions. [2025-03-08 06:27:19,042 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-08 06:27:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 283 transitions. [2025-03-08 06:27:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:27:19,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:19,042 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-08 06:27:19,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-08 06:27:19,043 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-08 06:27:19,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:19,043 INFO L85 PathProgramCache]: Analyzing trace with hash 248156968, now seen corresponding path program 1 times [2025-03-08 06:27:19,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:19,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723861959] [2025-03-08 06:27:19,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:19,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:19,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:27:19,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:27:19,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:19,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:19,122 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-08 06:27:19,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:19,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723861959] [2025-03-08 06:27:19,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723861959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:19,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:19,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:27:19,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600419231] [2025-03-08 06:27:19,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:19,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:27:19,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:19,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:27:19,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:27:19,123 INFO L87 Difference]: Start difference. First operand 216 states and 283 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-08 06:27:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:19,200 INFO L93 Difference]: Finished difference Result 910 states and 1311 transitions. [2025-03-08 06:27:19,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:27:19,201 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-08 06:27:19,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:19,202 INFO L225 Difference]: With dead ends: 910 [2025-03-08 06:27:19,202 INFO L226 Difference]: Without dead ends: 784 [2025-03-08 06:27:19,203 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-08 06:27:19,203 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 946 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:19,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 1196 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:27:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-03-08 06:27:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 340. [2025-03-08 06:27:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 1.3805309734513274) internal successors, (468), 339 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 468 transitions. [2025-03-08 06:27:19,207 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 468 transitions. Word has length 113 [2025-03-08 06:27:19,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:19,207 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 468 transitions. [2025-03-08 06:27:19,207 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-08 06:27:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 468 transitions. [2025-03-08 06:27:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:27:19,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:19,207 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-08 06:27:19,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-08 06:27:19,207 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:19,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1840525992, now seen corresponding path program 1 times [2025-03-08 06:27:19,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:19,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398358952] [2025-03-08 06:27:19,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:19,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:19,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:27:19,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:27:19,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:19,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:19,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:19,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398358952] [2025-03-08 06:27:19,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398358952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:19,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:19,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:27:19,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64085292] [2025-03-08 06:27:19,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:19,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:27:19,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:19,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:27:19,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:27:19,287 INFO L87 Difference]: Start difference. First operand 340 states and 468 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-08 06:27:19,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:19,358 INFO L93 Difference]: Finished difference Result 1034 states and 1496 transitions. [2025-03-08 06:27:19,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:27:19,359 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-08 06:27:19,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:19,360 INFO L225 Difference]: With dead ends: 1034 [2025-03-08 06:27:19,360 INFO L226 Difference]: Without dead ends: 908 [2025-03-08 06:27:19,361 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-08 06:27:19,361 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 986 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1088 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:19,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1088 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-08 06:27:19,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 526. [2025-03-08 06:27:19,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.4190476190476191) internal successors, (745), 525 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:19,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 745 transitions. [2025-03-08 06:27:19,366 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 745 transitions. Word has length 113 [2025-03-08 06:27:19,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:19,366 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 745 transitions. [2025-03-08 06:27:19,366 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-08 06:27:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 745 transitions. [2025-03-08 06:27:19,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:27:19,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:19,366 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-08 06:27:19,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-08 06:27:19,366 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:19,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1892880936, now seen corresponding path program 1 times [2025-03-08 06:27:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:19,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869160998] [2025-03-08 06:27:19,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:19,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:19,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:27:19,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:27:19,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:19,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:19,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:19,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869160998] [2025-03-08 06:27:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869160998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:19,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:19,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:27:19,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952987692] [2025-03-08 06:27:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:19,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:27:19,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:19,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:27:19,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:27:19,449 INFO L87 Difference]: Start difference. First operand 526 states and 745 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-08 06:27:19,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:19,515 INFO L93 Difference]: Finished difference Result 1158 states and 1681 transitions. [2025-03-08 06:27:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:27:19,515 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-08 06:27:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:19,516 INFO L225 Difference]: With dead ends: 1158 [2025-03-08 06:27:19,516 INFO L226 Difference]: Without dead ends: 1032 [2025-03-08 06:27:19,517 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-08 06:27:19,517 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1041 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 1062 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-08 06:27:19,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 1062 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:19,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-08 06:27:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 650. [2025-03-08 06:27:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 649 states have (on average 1.4329738058551618) internal successors, (930), 649 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 930 transitions. [2025-03-08 06:27:19,523 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 930 transitions. Word has length 113 [2025-03-08 06:27:19,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:19,523 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 930 transitions. [2025-03-08 06:27:19,523 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-08 06:27:19,523 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 930 transitions. [2025-03-08 06:27:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:27:19,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:19,524 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-08 06:27:19,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-08 06:27:19,524 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:19,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1451312728, now seen corresponding path program 1 times [2025-03-08 06:27:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:19,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922943544] [2025-03-08 06:27:19,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:19,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:27:19,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:27:19,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:19,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:19,601 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-08 06:27:19,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:19,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922943544] [2025-03-08 06:27:19,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922943544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:19,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:19,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:27:19,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109184590] [2025-03-08 06:27:19,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:19,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:27:19,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:19,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:27:19,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:27:19,602 INFO L87 Difference]: Start difference. First operand 650 states and 930 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-08 06:27:19,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:19,676 INFO L93 Difference]: Finished difference Result 1282 states and 1866 transitions. [2025-03-08 06:27:19,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:27:19,676 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-08 06:27:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:19,678 INFO L225 Difference]: With dead ends: 1282 [2025-03-08 06:27:19,678 INFO L226 Difference]: Without dead ends: 1156 [2025-03-08 06:27:19,678 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-08 06:27:19,678 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 970 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:19,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1173 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-03-08 06:27:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 774. [2025-03-08 06:27:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.4424320827943078) internal successors, (1115), 773 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1115 transitions. [2025-03-08 06:27:19,685 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1115 transitions. Word has length 113 [2025-03-08 06:27:19,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:19,685 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1115 transitions. [2025-03-08 06:27:19,685 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-08 06:27:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1115 transitions. [2025-03-08 06:27:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:27:19,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:19,686 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-08 06:27:19,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-08 06:27:19,686 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-08 06:27:19,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1951821052, now seen corresponding path program 1 times [2025-03-08 06:27:19,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:19,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182095901] [2025-03-08 06:27:19,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:19,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:27:19,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:27:19,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:19,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:19,725 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-08 06:27:19,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:19,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182095901] [2025-03-08 06:27:19,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182095901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:19,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:19,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:19,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129377307] [2025-03-08 06:27:19,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:19,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:19,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:19,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:19,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:19,726 INFO L87 Difference]: Start difference. First operand 774 states and 1115 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-08 06:27:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:19,747 INFO L93 Difference]: Finished difference Result 2071 states and 3028 transitions. [2025-03-08 06:27:19,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:19,747 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-08 06:27:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:19,749 INFO L225 Difference]: With dead ends: 2071 [2025-03-08 06:27:19,749 INFO L226 Difference]: Without dead ends: 1387 [2025-03-08 06:27:19,750 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-08 06:27:19,750 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 110 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 306 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-08 06:27:19,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 306 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2025-03-08 06:27:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1374. [2025-03-08 06:27:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1373 states have (on average 1.4340859431900947) internal successors, (1969), 1373 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:19,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1969 transitions. [2025-03-08 06:27:19,761 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1969 transitions. Word has length 113 [2025-03-08 06:27:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:19,761 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 1969 transitions. [2025-03-08 06:27:19,761 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-08 06:27:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1969 transitions. [2025-03-08 06:27:19,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 06:27:19,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:19,761 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-08 06:27:19,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-08 06:27:19,762 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-08 06:27:19,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:19,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1916727254, now seen corresponding path program 1 times [2025-03-08 06:27:19,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:19,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451255505] [2025-03-08 06:27:19,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:19,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 06:27:19,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 06:27:19,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:19,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:19,912 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-08 06:27:19,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:19,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451255505] [2025-03-08 06:27:19,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451255505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:19,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:19,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:27:19,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963415191] [2025-03-08 06:27:19,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:19,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:27:19,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:19,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:27:19,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:27:19,913 INFO L87 Difference]: Start difference. First operand 1374 states and 1969 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-08 06:27:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:20,009 INFO L93 Difference]: Finished difference Result 2660 states and 3843 transitions. [2025-03-08 06:27:20,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:27:20,009 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-08 06:27:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:20,011 INFO L225 Difference]: With dead ends: 2660 [2025-03-08 06:27:20,011 INFO L226 Difference]: Without dead ends: 1376 [2025-03-08 06:27:20,012 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-08 06:27:20,012 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 99 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 641 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-08 06:27:20,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 641 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:20,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-03-08 06:27:20,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1374. [2025-03-08 06:27:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1373 states have (on average 1.4297159504734158) internal successors, (1963), 1373 states have internal predecessors, (1963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1963 transitions. [2025-03-08 06:27:20,021 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1963 transitions. Word has length 113 [2025-03-08 06:27:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:20,021 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 1963 transitions. [2025-03-08 06:27:20,021 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-08 06:27:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1963 transitions. [2025-03-08 06:27:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 06:27:20,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:20,022 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-08 06:27:20,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-08 06:27:20,022 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-08 06:27:20,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:20,023 INFO L85 PathProgramCache]: Analyzing trace with hash 704120033, now seen corresponding path program 1 times [2025-03-08 06:27:20,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:20,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505231327] [2025-03-08 06:27:20,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:20,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:20,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 06:27:20,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 06:27:20,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:20,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:20,083 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-08 06:27:20,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:20,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505231327] [2025-03-08 06:27:20,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505231327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:20,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:20,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028400554] [2025-03-08 06:27:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:20,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:20,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:20,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:20,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:20,084 INFO L87 Difference]: Start difference. First operand 1374 states and 1963 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-08 06:27:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:20,098 INFO L93 Difference]: Finished difference Result 3854 states and 5543 transitions. [2025-03-08 06:27:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:20,098 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-08 06:27:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:20,101 INFO L225 Difference]: With dead ends: 3854 [2025-03-08 06:27:20,101 INFO L226 Difference]: Without dead ends: 2570 [2025-03-08 06:27:20,102 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-08 06:27:20,102 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 89 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 405 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-08 06:27:20,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 405 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2025-03-08 06:27:20,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2480. [2025-03-08 06:27:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 2479 states have (on average 1.4292053247277128) internal successors, (3543), 2479 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3543 transitions. [2025-03-08 06:27:20,120 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3543 transitions. Word has length 114 [2025-03-08 06:27:20,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:20,120 INFO L471 AbstractCegarLoop]: Abstraction has 2480 states and 3543 transitions. [2025-03-08 06:27:20,120 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-08 06:27:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3543 transitions. [2025-03-08 06:27:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 06:27:20,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:20,121 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-08 06:27:20,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-08 06:27:20,121 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-08 06:27:20,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash -976895441, now seen corresponding path program 1 times [2025-03-08 06:27:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:20,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094985719] [2025-03-08 06:27:20,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:20,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:20,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 06:27:20,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 06:27:20,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:20,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:20,190 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-08 06:27:20,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:20,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094985719] [2025-03-08 06:27:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094985719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:20,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:20,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322235277] [2025-03-08 06:27:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:20,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:20,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:20,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:20,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:20,191 INFO L87 Difference]: Start difference. First operand 2480 states and 3543 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-08 06:27:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:20,208 INFO L93 Difference]: Finished difference Result 7084 states and 10129 transitions. [2025-03-08 06:27:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:20,209 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-08 06:27:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:20,214 INFO L225 Difference]: With dead ends: 7084 [2025-03-08 06:27:20,214 INFO L226 Difference]: Without dead ends: 4694 [2025-03-08 06:27:20,215 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-08 06:27:20,216 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 82 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 405 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-08 06:27:20,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 405 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4694 states. [2025-03-08 06:27:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4694 to 4516. [2025-03-08 06:27:20,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4516 states, 4515 states have (on average 1.4212624584717608) internal successors, (6417), 4515 states have internal predecessors, (6417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 6417 transitions. [2025-03-08 06:27:20,261 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 6417 transitions. Word has length 115 [2025-03-08 06:27:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:20,261 INFO L471 AbstractCegarLoop]: Abstraction has 4516 states and 6417 transitions. [2025-03-08 06:27:20,261 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-08 06:27:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 6417 transitions. [2025-03-08 06:27:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 06:27:20,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:20,262 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-08 06:27:20,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-08 06:27:20,262 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-08 06:27:20,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:20,263 INFO L85 PathProgramCache]: Analyzing trace with hash -548061907, now seen corresponding path program 1 times [2025-03-08 06:27:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:20,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043492805] [2025-03-08 06:27:20,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:20,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 06:27:20,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 06:27:20,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:20,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:20,356 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-08 06:27:20,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:20,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043492805] [2025-03-08 06:27:20,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043492805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:20,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:20,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077085894] [2025-03-08 06:27:20,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:20,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:20,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:20,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:20,357 INFO L87 Difference]: Start difference. First operand 4516 states and 6417 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-08 06:27:20,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:20,386 INFO L93 Difference]: Finished difference Result 13016 states and 18443 transitions. [2025-03-08 06:27:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:20,386 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-08 06:27:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:20,398 INFO L225 Difference]: With dead ends: 13016 [2025-03-08 06:27:20,398 INFO L226 Difference]: Without dead ends: 8590 [2025-03-08 06:27:20,404 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-08 06:27:20,404 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 75 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 405 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-08 06:27:20,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 405 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8590 states. [2025-03-08 06:27:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8590 to 8236. [2025-03-08 06:27:20,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8236 states, 8235 states have (on average 1.4077717061323618) internal successors, (11593), 8235 states have internal predecessors, (11593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:20,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 11593 transitions. [2025-03-08 06:27:20,472 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 11593 transitions. Word has length 116 [2025-03-08 06:27:20,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:20,472 INFO L471 AbstractCegarLoop]: Abstraction has 8236 states and 11593 transitions. [2025-03-08 06:27:20,472 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-08 06:27:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 11593 transitions. [2025-03-08 06:27:20,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 06:27:20,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:20,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:20,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-08 06:27:20,473 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-08 06:27:20,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:20,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2011179397, now seen corresponding path program 1 times [2025-03-08 06:27:20,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:20,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224940004] [2025-03-08 06:27:20,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:20,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 06:27:20,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 06:27:20,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:20,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:20,567 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-08 06:27:20,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:20,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224940004] [2025-03-08 06:27:20,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224940004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:20,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:20,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180154927] [2025-03-08 06:27:20,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:20,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:20,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:20,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:20,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:20,568 INFO L87 Difference]: Start difference. First operand 8236 states and 11593 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-08 06:27:20,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:20,610 INFO L93 Difference]: Finished difference Result 23824 states and 33355 transitions. [2025-03-08 06:27:20,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:20,610 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-08 06:27:20,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:20,632 INFO L225 Difference]: With dead ends: 23824 [2025-03-08 06:27:20,632 INFO L226 Difference]: Without dead ends: 15678 [2025-03-08 06:27:20,641 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-08 06:27:20,642 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 65 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 405 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-08 06:27:20,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 405 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15678 states. [2025-03-08 06:27:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15678 to 14972. [2025-03-08 06:27:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14972 states, 14971 states have (on average 1.3894195444526083) internal successors, (20801), 14971 states have internal predecessors, (20801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14972 states to 14972 states and 20801 transitions. [2025-03-08 06:27:20,778 INFO L78 Accepts]: Start accepts. Automaton has 14972 states and 20801 transitions. Word has length 117 [2025-03-08 06:27:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:20,778 INFO L471 AbstractCegarLoop]: Abstraction has 14972 states and 20801 transitions. [2025-03-08 06:27:20,778 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-08 06:27:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 14972 states and 20801 transitions. [2025-03-08 06:27:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 06:27:20,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:20,779 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:27:20,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-08 06:27:20,779 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-08 06:27:20,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash -931301414, now seen corresponding path program 1 times [2025-03-08 06:27:20,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:20,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286274233] [2025-03-08 06:27:20,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:20,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:20,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 06:27:20,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 06:27:20,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:20,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:20,952 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-08 06:27:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:20,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286274233] [2025-03-08 06:27:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286274233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:20,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:20,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:27:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242236960] [2025-03-08 06:27:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:27:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:20,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:27:20,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:27:20,953 INFO L87 Difference]: Start difference. First operand 14972 states and 20801 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-08 06:27:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:20,989 INFO L93 Difference]: Finished difference Result 15454 states and 21442 transitions. [2025-03-08 06:27:20,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:27:20,990 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-08 06:27:20,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:21,007 INFO L225 Difference]: With dead ends: 15454 [2025-03-08 06:27:21,008 INFO L226 Difference]: Without dead ends: 15452 [2025-03-08 06:27:21,012 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-08 06:27:21,013 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 924 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-08 06:27:21,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 924 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15452 states. [2025-03-08 06:27:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15452 to 15452. [2025-03-08 06:27:21,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15452 states, 15451 states have (on average 1.3711086661057537) internal successors, (21185), 15451 states have internal predecessors, (21185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15452 states to 15452 states and 21185 transitions. [2025-03-08 06:27:21,146 INFO L78 Accepts]: Start accepts. Automaton has 15452 states and 21185 transitions. Word has length 118 [2025-03-08 06:27:21,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:21,147 INFO L471 AbstractCegarLoop]: Abstraction has 15452 states and 21185 transitions. [2025-03-08 06:27:21,147 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-08 06:27:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 15452 states and 21185 transitions. [2025-03-08 06:27:21,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 06:27:21,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:21,148 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-08 06:27:21,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-08 06:27:21,148 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-08 06:27:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1438871329, now seen corresponding path program 1 times [2025-03-08 06:27:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051923752] [2025-03-08 06:27:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:21,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 06:27:21,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 06:27:21,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:21,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:21,274 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-08 06:27:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:21,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051923752] [2025-03-08 06:27:21,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051923752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:21,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:27:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070964839] [2025-03-08 06:27:21,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:27:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:21,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:27:21,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:27:21,276 INFO L87 Difference]: Start difference. First operand 15452 states and 21185 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-08 06:27:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:21,392 INFO L93 Difference]: Finished difference Result 29464 states and 40551 transitions. [2025-03-08 06:27:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:27:21,392 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-08 06:27:21,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:21,421 INFO L225 Difference]: With dead ends: 29464 [2025-03-08 06:27:21,421 INFO L226 Difference]: Without dead ends: 26662 [2025-03-08 06:27:21,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:27:21,430 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 971 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1292 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-08 06:27:21,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1292 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26662 states. [2025-03-08 06:27:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26662 to 18252. [2025-03-08 06:27:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18252 states, 18251 states have (on average 1.3711577447811079) internal successors, (25025), 18251 states have internal predecessors, (25025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:21,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18252 states to 18252 states and 25025 transitions. [2025-03-08 06:27:21,626 INFO L78 Accepts]: Start accepts. Automaton has 18252 states and 25025 transitions. Word has length 118 [2025-03-08 06:27:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:21,626 INFO L471 AbstractCegarLoop]: Abstraction has 18252 states and 25025 transitions. [2025-03-08 06:27:21,626 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-08 06:27:21,626 INFO L276 IsEmpty]: Start isEmpty. Operand 18252 states and 25025 transitions. [2025-03-08 06:27:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 06:27:21,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:21,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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:21,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-08 06:27:21,627 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-08 06:27:21,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash 145017134, now seen corresponding path program 1 times [2025-03-08 06:27:21,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:21,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450982022] [2025-03-08 06:27:21,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:21,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:21,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 06:27:21,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 06:27:21,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:21,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:21,731 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-08 06:27:21,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:21,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450982022] [2025-03-08 06:27:21,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450982022] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:21,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:21,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:21,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702850809] [2025-03-08 06:27:21,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:21,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:21,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:21,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:21,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:21,732 INFO L87 Difference]: Start difference. First operand 18252 states and 25025 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-08 06:27:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:21,820 INFO L93 Difference]: Finished difference Result 47296 states and 64675 transitions. [2025-03-08 06:27:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:21,820 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-08 06:27:21,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:21,853 INFO L225 Difference]: With dead ends: 47296 [2025-03-08 06:27:21,853 INFO L226 Difference]: Without dead ends: 29134 [2025-03-08 06:27:21,871 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-08 06:27:21,871 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 93 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 408 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-08 06:27:21,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 408 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29134 states. [2025-03-08 06:27:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29134 to 27468. [2025-03-08 06:27:22,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27468 states, 27467 states have (on average 1.3561364546546766) internal successors, (37249), 27467 states have internal predecessors, (37249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27468 states to 27468 states and 37249 transitions. [2025-03-08 06:27:22,194 INFO L78 Accepts]: Start accepts. Automaton has 27468 states and 37249 transitions. Word has length 119 [2025-03-08 06:27:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:22,194 INFO L471 AbstractCegarLoop]: Abstraction has 27468 states and 37249 transitions. [2025-03-08 06:27:22,194 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-08 06:27:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 27468 states and 37249 transitions. [2025-03-08 06:27:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 06:27:22,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:22,197 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-08 06:27:22,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-08 06:27:22,197 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-08 06:27:22,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:22,197 INFO L85 PathProgramCache]: Analyzing trace with hash 330631624, now seen corresponding path program 1 times [2025-03-08 06:27:22,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:22,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287464799] [2025-03-08 06:27:22,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:22,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:22,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 06:27:22,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 06:27:22,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:22,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:22,278 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-08 06:27:22,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:22,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287464799] [2025-03-08 06:27:22,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287464799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:22,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:22,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:22,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474907892] [2025-03-08 06:27:22,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:22,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:22,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:22,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:22,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:22,280 INFO L87 Difference]: Start difference. First operand 27468 states and 37249 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-08 06:27:22,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:22,393 INFO L93 Difference]: Finished difference Result 54848 states and 74403 transitions. [2025-03-08 06:27:22,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:22,394 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-08 06:27:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:22,419 INFO L225 Difference]: With dead ends: 54848 [2025-03-08 06:27:22,419 INFO L226 Difference]: Without dead ends: 27470 [2025-03-08 06:27:22,440 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-08 06:27:22,440 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 81 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 379 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-08 06:27:22,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 379 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27470 states. [2025-03-08 06:27:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27470 to 27468. [2025-03-08 06:27:22,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27468 states, 27467 states have (on average 1.340991007390687) internal successors, (36833), 27467 states have internal predecessors, (36833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:22,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27468 states to 27468 states and 36833 transitions. [2025-03-08 06:27:22,718 INFO L78 Accepts]: Start accepts. Automaton has 27468 states and 36833 transitions. Word has length 149 [2025-03-08 06:27:22,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:22,718 INFO L471 AbstractCegarLoop]: Abstraction has 27468 states and 36833 transitions. [2025-03-08 06:27:22,718 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-08 06:27:22,719 INFO L276 IsEmpty]: Start isEmpty. Operand 27468 states and 36833 transitions. [2025-03-08 06:27:22,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 06:27:22,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:22,721 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-08 06:27:22,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-08 06:27:22,721 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-08 06:27:22,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:22,721 INFO L85 PathProgramCache]: Analyzing trace with hash -395837479, now seen corresponding path program 1 times [2025-03-08 06:27:22,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:22,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975198132] [2025-03-08 06:27:22,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:22,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:22,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 06:27:22,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 06:27:22,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:22,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:23,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:23,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975198132] [2025-03-08 06:27:23,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975198132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:27:23,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071172146] [2025-03-08 06:27:23,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:23,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:27:23,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:27:23,031 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-08 06:27:23,032 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-08 06:27:23,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 06:27:23,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 06:27:23,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:23,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:23,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 06:27:23,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:27:23,972 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-08 06:27:23,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:27:25,202 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-08 06:27:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071172146] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:27:25,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:27:25,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2025-03-08 06:27:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212652154] [2025-03-08 06:27:25,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:27:25,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-08 06:27:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:25,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-08 06:27:25,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2025-03-08 06:27:25,203 INFO L87 Difference]: Start difference. First operand 27468 states and 36833 transitions. Second operand has 31 states, 31 states have (on average 13.064516129032258) internal successors, (405), 30 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:32,259 INFO L93 Difference]: Finished difference Result 231575 states and 308490 transitions. [2025-03-08 06:27:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2025-03-08 06:27:32,259 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 13.064516129032258) internal successors, (405), 30 states have internal predecessors, (405), 0 states have call successors, (0), 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-08 06:27:32,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:32,497 INFO L225 Difference]: With dead ends: 231575 [2025-03-08 06:27:32,497 INFO L226 Difference]: Without dead ends: 204197 [2025-03-08 06:27:32,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10669 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4761, Invalid=27459, Unknown=0, NotChecked=0, Total=32220 [2025-03-08 06:27:32,565 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 5056 mSDsluCounter, 3115 mSDsCounter, 0 mSdLazyCounter, 4252 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5056 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 4345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 4252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:32,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5056 Valid, 3333 Invalid, 4345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 4252 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 06:27:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204197 states. [2025-03-08 06:27:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204197 to 136997. [2025-03-08 06:27:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136997 states, 136996 states have (on average 1.3307030862214955) internal successors, (182301), 136996 states have internal predecessors, (182301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136997 states to 136997 states and 182301 transitions. [2025-03-08 06:27:34,540 INFO L78 Accepts]: Start accepts. Automaton has 136997 states and 182301 transitions. Word has length 149 [2025-03-08 06:27:34,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:34,540 INFO L471 AbstractCegarLoop]: Abstraction has 136997 states and 182301 transitions. [2025-03-08 06:27:34,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 13.064516129032258) internal successors, (405), 30 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 136997 states and 182301 transitions. [2025-03-08 06:27:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 06:27:34,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:34,549 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:34,556 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-08 06:27:34,749 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,SelfDestructingSolverStorable59 [2025-03-08 06:27:34,750 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-08 06:27:34,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:34,750 INFO L85 PathProgramCache]: Analyzing trace with hash -554039470, now seen corresponding path program 1 times [2025-03-08 06:27:34,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:34,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374585980] [2025-03-08 06:27:34,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:34,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:34,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 06:27:34,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 06:27:34,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:34,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:35,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374585980] [2025-03-08 06:27:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374585980] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:27:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035924990] [2025-03-08 06:27:35,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:35,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:27:35,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:27:35,110 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-08 06:27:35,111 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-08 06:27:35,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 06:27:35,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 06:27:35,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:35,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:35,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 06:27:35,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:27:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:35,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:27:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:27:36,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035924990] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:27:36,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:27:36,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 27 [2025-03-08 06:27:36,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188845767] [2025-03-08 06:27:36,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:27:36,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 06:27:36,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:36,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 06:27:36,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2025-03-08 06:27:36,205 INFO L87 Difference]: Start difference. First operand 136997 states and 182301 transitions. Second operand has 27 states, 27 states have (on average 14.88888888888889) internal successors, (402), 27 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:43,503 INFO L93 Difference]: Finished difference Result 646379 states and 860285 transitions. [2025-03-08 06:27:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2025-03-08 06:27:43,503 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 14.88888888888889) internal successors, (402), 27 states have internal predecessors, (402), 0 states have call successors, (0), 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-08 06:27:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:44,316 INFO L225 Difference]: With dead ends: 646379 [2025-03-08 06:27:44,316 INFO L226 Difference]: Without dead ends: 509541 [2025-03-08 06:27:44,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6049 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2891, Invalid=16569, Unknown=0, NotChecked=0, Total=19460 [2025-03-08 06:27:44,396 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 6154 mSDsluCounter, 3706 mSDsCounter, 0 mSdLazyCounter, 4791 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6154 SdHoareTripleChecker+Valid, 3956 SdHoareTripleChecker+Invalid, 4877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 4791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:44,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6154 Valid, 3956 Invalid, 4877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 4791 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 06:27:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509541 states. [2025-03-08 06:27:48,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509541 to 328116. [2025-03-08 06:27:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328116 states, 328115 states have (on average 1.3278758971701994) internal successors, (435696), 328115 states have internal predecessors, (435696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:49,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328116 states to 328116 states and 435696 transitions. [2025-03-08 06:27:49,599 INFO L78 Accepts]: Start accepts. Automaton has 328116 states and 435696 transitions. Word has length 150 [2025-03-08 06:27:49,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:27:49,599 INFO L471 AbstractCegarLoop]: Abstraction has 328116 states and 435696 transitions. [2025-03-08 06:27:49,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 14.88888888888889) internal successors, (402), 27 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:49,599 INFO L276 IsEmpty]: Start isEmpty. Operand 328116 states and 435696 transitions. [2025-03-08 06:27:49,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 06:27:49,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:27:49,620 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:27:49,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:27:49,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable60 [2025-03-08 06:27:49,820 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-08 06:27:49,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:27:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash -753839077, now seen corresponding path program 1 times [2025-03-08 06:27:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:27:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686389830] [2025-03-08 06:27:49,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:27:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:27:49,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 06:27:49,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 06:27:49,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:27:49,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:27:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:27:49,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:27:49,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686389830] [2025-03-08 06:27:49,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686389830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:27:49,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:27:49,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:27:49,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929012508] [2025-03-08 06:27:49,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:27:49,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:27:49,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:27:49,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:27:49,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:27:49,868 INFO L87 Difference]: Start difference. First operand 328116 states and 435696 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:27:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:27:51,702 INFO L93 Difference]: Finished difference Result 635567 states and 846145 transitions. [2025-03-08 06:27:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:27:51,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 151 [2025-03-08 06:27:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:27:52,125 INFO L225 Difference]: With dead ends: 635567 [2025-03-08 06:27:52,125 INFO L226 Difference]: Without dead ends: 307698 [2025-03-08 06:27:52,240 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-08 06:27:52,240 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 123 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:27:52,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 160 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:27:52,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307698 states. [2025-03-08 06:27:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307698 to 307698.