./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+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:34:17,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:34:17,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:34:17,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:34:17,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:34:17,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:34:17,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:34:17,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:34:17,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:34:17,376 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:34:17,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:34:17,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:34:17,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:34:17,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:34:17,377 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:34:17,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:34:17,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:34:17,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:34:17,378 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 -> 876148c876cf7c1b78d2f058097c1ea19d5931075241b9f9a3c243e2bacc58fd [2025-03-16 19:34:17,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:34:17,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:34:17,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:34:17,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:34:17,592 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:34:17,594 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+lhb-reducer.c [2025-03-16 19:34:18,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d02a3516/b1a967d585874d419fcef9c89e202614/FLAGe27f413e9 [2025-03-16 19:34:19,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:34:19,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-16 19:34:19,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d02a3516/b1a967d585874d419fcef9c89e202614/FLAGe27f413e9 [2025-03-16 19:34:19,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d02a3516/b1a967d585874d419fcef9c89e202614 [2025-03-16 19:34:19,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:34:19,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:34:19,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:34:19,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:34:19,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:34:19,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:19,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383f20ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19, skipping insertion in model container [2025-03-16 19:34:19,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:19,365 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:34:19,548 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+lhb-reducer.c[10927,10940] [2025-03-16 19:34:19,563 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+lhb-reducer.c[14764,14777] [2025-03-16 19:34:19,567 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+lhb-reducer.c[15985,15998] [2025-03-16 19:34:19,570 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+lhb-reducer.c[16691,16704] [2025-03-16 19:34:19,574 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+lhb-reducer.c[18235,18248] [2025-03-16 19:34:19,577 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+lhb-reducer.c[18941,18954] [2025-03-16 19:34:19,581 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+lhb-reducer.c[19970,19983] [2025-03-16 19:34:19,588 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+lhb-reducer.c[22376,22389] [2025-03-16 19:34:19,590 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+lhb-reducer.c[23085,23098] [2025-03-16 19:34:19,594 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+lhb-reducer.c[24122,24135] [2025-03-16 19:34:19,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+lhb-reducer.c[26018,26031] [2025-03-16 19:34:19,612 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+lhb-reducer.c[29926,29939] [2025-03-16 19:34:19,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+lhb-reducer.c[30635,30648] [2025-03-16 19:34:19,617 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+lhb-reducer.c[31667,31680] [2025-03-16 19:34:19,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+lhb-reducer.c[33558,33571] [2025-03-16 19:34:19,631 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+lhb-reducer.c[36771,36784] [2025-03-16 19:34:19,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:34:19,729 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:34:19,775 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+lhb-reducer.c[10927,10940] [2025-03-16 19:34:19,782 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+lhb-reducer.c[14764,14777] [2025-03-16 19:34:19,786 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+lhb-reducer.c[15985,15998] [2025-03-16 19:34:19,788 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+lhb-reducer.c[16691,16704] [2025-03-16 19:34:19,792 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+lhb-reducer.c[18235,18248] [2025-03-16 19:34:19,796 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+lhb-reducer.c[18941,18954] [2025-03-16 19:34:19,799 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+lhb-reducer.c[19970,19983] [2025-03-16 19:34:19,803 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+lhb-reducer.c[22376,22389] [2025-03-16 19:34:19,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+lhb-reducer.c[23085,23098] [2025-03-16 19:34:19,807 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+lhb-reducer.c[24122,24135] [2025-03-16 19:34:19,815 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+lhb-reducer.c[26018,26031] [2025-03-16 19:34:19,821 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+lhb-reducer.c[29926,29939] [2025-03-16 19:34:19,823 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+lhb-reducer.c[30635,30648] [2025-03-16 19:34:19,825 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+lhb-reducer.c[31667,31680] [2025-03-16 19:34:19,828 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+lhb-reducer.c[33558,33571] [2025-03-16 19:34:19,833 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+lhb-reducer.c[36771,36784] [2025-03-16 19:34:19,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:34:19,905 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:34:19,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19 WrapperNode [2025-03-16 19:34:19,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:34:19,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:34:19,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:34:19,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:34:19,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:19,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:19,985 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3577 [2025-03-16 19:34:19,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:34:19,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:34:19,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:34:19,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:34:19,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:19,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:20,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:20,033 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:34:20,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:20,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:20,063 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:20,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:20,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:20,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:20,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:34:20,086 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:34:20,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:34:20,087 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:34:20,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (1/1) ... [2025-03-16 19:34:20,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:34:20,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:34:20,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:34:20,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:34:20,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:34:20,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:34:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:34:20,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:34:20,323 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:34:20,324 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:34:21,889 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4067: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1426: havoc main_~node3__m3~3#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4532: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L503: havoc main_~node2__m2~2#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2551: havoc main_~node5__m5~14#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5524: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4996: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3609: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2685: havoc main_~check__tmp~26#1;havoc main_~node5__m5~15#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4601: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2289: havoc main_~node4__m4~7#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2025: havoc main_~node5__m5~10#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1629: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4338: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2621: havoc main_~check__tmp~25#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5066: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L706: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4868: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1500: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3945: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-03-16 19:34:21,890 INFO L1322 $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-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2162: havoc main_~node5__m5~11#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5135: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4937: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2025-03-16 19:34:21,890 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L974: havoc main_~node5__m5~3#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4674: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5402: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2760: havoc main_~node4__m4~9#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2232: havoc main_~check__tmp~20#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3092: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L846: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1771: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1441: havoc main_~node4__m4~4#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5471: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L384: havoc main_~node2__m2~1#1; [2025-03-16 19:34:21,892 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3820: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2025-03-16 19:34:21,893 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L518: havoc main_~node3__m3~2#1; [2025-03-16 19:34:21,893 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3889: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1; [2025-03-16 19:34:21,893 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2304: havoc main_~node5__m5~12#1; [2025-03-16 19:34:21,893 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5013: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-03-16 19:34:21,893 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3626: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3428: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4287: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~check__tmp~23#1;havoc main_~node5__m5~13#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4156: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: havoc main_~check__tmp~22#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1317: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L591: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4225: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5349: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1980: havoc main_~node2__m2~3#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3962: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1188: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-16 19:34:21,894 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3039: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L661: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L926: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1720: havoc main_~node4__m4~5#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1456: havoc main_~node5__m5~6#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L399: havoc main_~node3__m3~1#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3306: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~31#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L796: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4496: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L533: havoc main_~node4__m4~2#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5224: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~32#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1129: havoc main_~node4__m4~3#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2120: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1593: havoc main_~node5__m5~7#1; [2025-03-16 19:34:21,895 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5293: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5030: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4832: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4304: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2587: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2521: havoc main_~node3__m3~5#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5560: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1663: havoc main_~check__tmp~13#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1069: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1995: havoc main_~node3__m3~4#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5629: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4374: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5366: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-16 19:34:21,896 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3253: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2857: havoc main_~node5__m5~17#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4443: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1735: havoc main_~node5__m5~8#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L414: havoc main_~node4__m4~1#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2198: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3784: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1869: havoc main_~check__tmp~16#1;havoc main_~node5__m5~9#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4710: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L548: havoc main_~node5__m5~2#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: 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-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1144: havoc main_~node5__m5~4#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2069: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1805: havoc main_~check__tmp~15#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4779: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2025-03-16 19:34:21,897 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3128: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4120: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L751: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3592: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2800: havoc main_~check__tmp~27#1;havoc main_~node5__m5~16#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536: havoc main_~node4__m4~8#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1281: havoc main_~node5__m5~5#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3197: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4321: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1018: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2340: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2010: havoc main_~node4__m4~6#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3662: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3464: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~33#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1351: havoc main_~check__tmp~9#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3731: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1551: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3533: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L362: 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-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4657: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L429: havoc main_~node5__m5~1#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L297: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3270: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3998: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2025-03-16 19:34:21,898 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5188: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-03-16 19:34:22,001 INFO L? ?]: Removed 539 outVars from TransFormulas that were not future-live. [2025-03-16 19:34:22,001 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:34:22,027 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:34:22,027 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:34:22,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:34:22 BoogieIcfgContainer [2025-03-16 19:34:22,028 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:34:22,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:34:22,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:34:22,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:34:22,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:34:19" (1/3) ... [2025-03-16 19:34:22,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d095ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:34:22, skipping insertion in model container [2025-03-16 19:34:22,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:19" (2/3) ... [2025-03-16 19:34:22,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d095ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:34:22, skipping insertion in model container [2025-03-16 19:34:22,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:34:22" (3/3) ... [2025-03-16 19:34:22,037 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-03-16 19:34:22,049 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:34:22,053 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 625 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-03-16 19:34:22,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:34:22,131 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;@733046ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:34:22,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-16 19:34:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 625 states, 608 states have (on average 1.8519736842105263) internal successors, (1126), 624 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-16 19:34:22,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:22,150 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:22,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:22,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 486846169, now seen corresponding path program 1 times [2025-03-16 19:34:22,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437104668] [2025-03-16 19:34:22,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:22,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:22,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-16 19:34:22,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-16 19:34:22,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:22,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:22,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:22,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437104668] [2025-03-16 19:34:22,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437104668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:22,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:22,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012166046] [2025-03-16 19:34:22,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:22,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:22,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:22,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:22,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:22,687 INFO L87 Difference]: Start difference. First operand has 625 states, 608 states have (on average 1.8519736842105263) internal successors, (1126), 624 states have internal predecessors, (1126), 0 states have call successors, (0), 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.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:23,088 INFO L93 Difference]: Finished difference Result 970 states and 1685 transitions. [2025-03-16 19:34:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2025-03-16 19:34:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:23,098 INFO L225 Difference]: With dead ends: 970 [2025-03-16 19:34:23,099 INFO L226 Difference]: Without dead ends: 497 [2025-03-16 19:34:23,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:34:23,103 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 2526 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2526 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:23,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2526 Valid, 602 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:34:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-03-16 19:34:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-03-16 19:34:23,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 481 states have (on average 1.3118503118503118) internal successors, (631), 496 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 631 transitions. [2025-03-16 19:34:23,156 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 631 transitions. Word has length 70 [2025-03-16 19:34:23,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:23,157 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 631 transitions. [2025-03-16 19:34:23,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 631 transitions. [2025-03-16 19:34:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:34:23,163 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:23,164 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] [2025-03-16 19:34:23,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:34:23,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:23,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 653875871, now seen corresponding path program 1 times [2025-03-16 19:34:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:23,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56545183] [2025-03-16 19:34:23,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:23,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:34:23,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:34:23,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:23,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:23,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:23,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56545183] [2025-03-16 19:34:23,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56545183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:23,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:23,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:23,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617493057] [2025-03-16 19:34:23,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:23,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:23,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:23,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:23,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:23,371 INFO L87 Difference]: Start difference. First operand 497 states and 631 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:23,643 INFO L93 Difference]: Finished difference Result 833 states and 1086 transitions. [2025-03-16 19:34:23,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:23,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2025-03-16 19:34:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:23,645 INFO L225 Difference]: With dead ends: 833 [2025-03-16 19:34:23,647 INFO L226 Difference]: Without dead ends: 445 [2025-03-16 19:34:23,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:34:23,649 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 1630 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:23,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 341 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:23,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-16 19:34:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-03-16 19:34:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 429 states have (on average 1.3286713286713288) internal successors, (570), 444 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 570 transitions. [2025-03-16 19:34:23,670 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 570 transitions. Word has length 71 [2025-03-16 19:34:23,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:23,670 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 570 transitions. [2025-03-16 19:34:23,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 570 transitions. [2025-03-16 19:34:23,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:34:23,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:23,675 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-16 19:34:23,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:34:23,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:23,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1815556415, now seen corresponding path program 1 times [2025-03-16 19:34:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:23,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810589665] [2025-03-16 19:34:23,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:23,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:23,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:34:23,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:34:23,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:23,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:23,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:23,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810589665] [2025-03-16 19:34:23,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810589665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:23,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:23,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:23,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897071604] [2025-03-16 19:34:23,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:23,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:23,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:23,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:23,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:23,865 INFO L87 Difference]: Start difference. First operand 445 states and 570 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-16 19:34:24,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:24,072 INFO L93 Difference]: Finished difference Result 781 states and 1024 transitions. [2025-03-16 19:34:24,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:24,073 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-16 19:34:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:24,074 INFO L225 Difference]: With dead ends: 781 [2025-03-16 19:34:24,074 INFO L226 Difference]: Without dead ends: 410 [2025-03-16 19:34:24,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:34:24,075 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 1536 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:24,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 318 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:24,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-16 19:34:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2025-03-16 19:34:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 394 states have (on average 1.3451776649746192) internal successors, (530), 409 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 530 transitions. [2025-03-16 19:34:24,083 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 530 transitions. Word has length 72 [2025-03-16 19:34:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:24,083 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 530 transitions. [2025-03-16 19:34:24,083 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-16 19:34:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 530 transitions. [2025-03-16 19:34:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:34:24,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:24,085 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-16 19:34:24,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:34:24,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:24,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1786316791, now seen corresponding path program 1 times [2025-03-16 19:34:24,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:24,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263746401] [2025-03-16 19:34:24,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:24,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:24,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:34:24,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:34:24,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:24,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:24,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:24,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263746401] [2025-03-16 19:34:24,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263746401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:24,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:24,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:24,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011596729] [2025-03-16 19:34:24,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:24,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:24,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:24,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:24,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:24,193 INFO L87 Difference]: Start difference. First operand 410 states and 530 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-16 19:34:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:24,390 INFO L93 Difference]: Finished difference Result 746 states and 983 transitions. [2025-03-16 19:34:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:24,390 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-16 19:34:24,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:24,392 INFO L225 Difference]: With dead ends: 746 [2025-03-16 19:34:24,392 INFO L226 Difference]: Without dead ends: 394 [2025-03-16 19:34:24,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:34:24,393 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1466 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:24,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 308 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:24,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-16 19:34:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-16 19:34:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 378 states have (on average 1.3518518518518519) internal successors, (511), 393 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 511 transitions. [2025-03-16 19:34:24,399 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 511 transitions. Word has length 73 [2025-03-16 19:34:24,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:24,400 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 511 transitions. [2025-03-16 19:34:24,400 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-16 19:34:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 511 transitions. [2025-03-16 19:34:24,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:34:24,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:24,401 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-16 19:34:24,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:34:24,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:24,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:24,402 INFO L85 PathProgramCache]: Analyzing trace with hash 314361105, now seen corresponding path program 1 times [2025-03-16 19:34:24,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:24,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015346498] [2025-03-16 19:34:24,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:24,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:24,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:34:24,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:34:24,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:24,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:24,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:24,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:24,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015346498] [2025-03-16 19:34:24,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015346498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:24,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:24,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:34:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480484673] [2025-03-16 19:34:24,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:24,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:24,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:24,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:24,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:24,515 INFO L87 Difference]: Start difference. First operand 394 states and 511 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-16 19:34:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:24,742 INFO L93 Difference]: Finished difference Result 730 states and 963 transitions. [2025-03-16 19:34:24,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:24,742 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-16 19:34:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:24,744 INFO L225 Difference]: With dead ends: 730 [2025-03-16 19:34:24,744 INFO L226 Difference]: Without dead ends: 389 [2025-03-16 19:34:24,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:34:24,745 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 1411 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:24,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 281 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:24,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-03-16 19:34:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2025-03-16 19:34:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.351206434316354) internal successors, (504), 388 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-16 19:34:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 504 transitions. [2025-03-16 19:34:24,751 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 504 transitions. Word has length 74 [2025-03-16 19:34:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:24,751 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 504 transitions. [2025-03-16 19:34:24,751 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-16 19:34:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 504 transitions. [2025-03-16 19:34:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:34:24,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:24,752 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-16 19:34:24,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:34:24,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:24,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash 945919618, now seen corresponding path program 1 times [2025-03-16 19:34:24,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:24,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501751740] [2025-03-16 19:34:24,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:24,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:24,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:34:24,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:34:24,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:24,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:25,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:25,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:25,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501751740] [2025-03-16 19:34:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501751740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:25,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:25,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:34:25,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961346580] [2025-03-16 19:34:25,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:25,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:34:25,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:25,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:34:25,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:34:25,033 INFO L87 Difference]: Start difference. First operand 389 states and 504 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-16 19:34:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:25,513 INFO L93 Difference]: Finished difference Result 753 states and 961 transitions. [2025-03-16 19:34:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:25,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-16 19:34:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:25,515 INFO L225 Difference]: With dead ends: 753 [2025-03-16 19:34:25,515 INFO L226 Difference]: Without dead ends: 541 [2025-03-16 19:34:25,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:25,516 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1760 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:25,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 894 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:25,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-16 19:34:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 389. [2025-03-16 19:34:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3485254691689008) internal successors, (503), 388 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-16 19:34:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 503 transitions. [2025-03-16 19:34:25,523 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 503 transitions. Word has length 75 [2025-03-16 19:34:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:25,523 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 503 transitions. [2025-03-16 19:34:25,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 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-16 19:34:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 503 transitions. [2025-03-16 19:34:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:34:25,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:25,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] [2025-03-16 19:34:25,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:34:25,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:25,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash 704319467, now seen corresponding path program 1 times [2025-03-16 19:34:25,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:25,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972990971] [2025-03-16 19:34:25,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:25,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:25,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:34:25,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:34:25,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:25,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972990971] [2025-03-16 19:34:25,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972990971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:25,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:25,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:25,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941274498] [2025-03-16 19:34:25,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:25,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:25,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:25,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:25,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:25,819 INFO L87 Difference]: Start difference. First operand 389 states and 503 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-16 19:34:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:26,545 INFO L93 Difference]: Finished difference Result 732 states and 966 transitions. [2025-03-16 19:34:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:26,546 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-16 19:34:26,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:26,549 INFO L225 Difference]: With dead ends: 732 [2025-03-16 19:34:26,549 INFO L226 Difference]: Without dead ends: 604 [2025-03-16 19:34:26,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:26,551 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 1529 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:26,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1529 Valid, 2107 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 19:34:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-16 19:34:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 389. [2025-03-16 19:34:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3458445040214477) internal successors, (502), 388 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-16 19:34:26,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 502 transitions. [2025-03-16 19:34:26,560 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 502 transitions. Word has length 75 [2025-03-16 19:34:26,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:26,561 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 502 transitions. [2025-03-16 19:34:26,561 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-16 19:34:26,561 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 502 transitions. [2025-03-16 19:34:26,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:34:26,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:26,562 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-16 19:34:26,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:34:26,562 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:26,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash 135395993, now seen corresponding path program 1 times [2025-03-16 19:34:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:26,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792360967] [2025-03-16 19:34:26,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:26,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:26,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:34:26,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:34:26,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:26,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:26,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792360967] [2025-03-16 19:34:26,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792360967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:26,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:26,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:26,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492596596] [2025-03-16 19:34:26,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:26,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:26,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:26,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:26,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:26,813 INFO L87 Difference]: Start difference. First operand 389 states and 502 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-16 19:34:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:27,392 INFO L93 Difference]: Finished difference Result 689 states and 910 transitions. [2025-03-16 19:34:27,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:27,393 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-16 19:34:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:27,395 INFO L225 Difference]: With dead ends: 689 [2025-03-16 19:34:27,395 INFO L226 Difference]: Without dead ends: 600 [2025-03-16 19:34:27,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:27,395 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 1493 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:27,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1694 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-16 19:34:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2025-03-16 19:34:27,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3431635388739946) internal successors, (501), 388 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-16 19:34:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 501 transitions. [2025-03-16 19:34:27,404 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 501 transitions. Word has length 75 [2025-03-16 19:34:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:27,404 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 501 transitions. [2025-03-16 19:34:27,405 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-16 19:34:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 501 transitions. [2025-03-16 19:34:27,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:34:27,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:27,405 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-16 19:34:27,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:34:27,406 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:27,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:27,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1953745099, now seen corresponding path program 1 times [2025-03-16 19:34:27,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:27,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914346237] [2025-03-16 19:34:27,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:27,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:27,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:34:27,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:34:27,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:27,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:27,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914346237] [2025-03-16 19:34:27,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914346237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:27,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:27,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:27,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205929327] [2025-03-16 19:34:27,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:27,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:27,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:27,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:27,602 INFO L87 Difference]: Start difference. First operand 389 states and 501 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:28,188 INFO L93 Difference]: Finished difference Result 673 states and 878 transitions. [2025-03-16 19:34:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:28,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:28,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:28,190 INFO L225 Difference]: With dead ends: 673 [2025-03-16 19:34:28,190 INFO L226 Difference]: Without dead ends: 592 [2025-03-16 19:34:28,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:28,191 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1994 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1994 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:28,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1994 Valid, 1290 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-16 19:34:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2025-03-16 19:34:28,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3404825737265416) internal successors, (500), 388 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-16 19:34:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 500 transitions. [2025-03-16 19:34:28,199 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 500 transitions. Word has length 77 [2025-03-16 19:34:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:28,199 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 500 transitions. [2025-03-16 19:34:28,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:28,200 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 500 transitions. [2025-03-16 19:34:28,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:34:28,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:28,201 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-16 19:34:28,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:34:28,201 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:28,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:28,202 INFO L85 PathProgramCache]: Analyzing trace with hash -280271155, now seen corresponding path program 1 times [2025-03-16 19:34:28,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:28,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190797140] [2025-03-16 19:34:28,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:28,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:34:28,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:34:28,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:28,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:28,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:28,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190797140] [2025-03-16 19:34:28,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190797140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:28,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:28,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:34:28,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384247363] [2025-03-16 19:34:28,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:28,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:34:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:28,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:34:28,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:34:28,591 INFO L87 Difference]: Start difference. First operand 389 states and 500 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:29,917 INFO L93 Difference]: Finished difference Result 940 states and 1271 transitions. [2025-03-16 19:34:29,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:34:29,918 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-16 19:34:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:29,921 INFO L225 Difference]: With dead ends: 940 [2025-03-16 19:34:29,922 INFO L226 Difference]: Without dead ends: 842 [2025-03-16 19:34:29,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:34:29,923 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 3322 mSDsluCounter, 2162 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3322 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:29,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3322 Valid, 2622 Invalid, 2433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:34:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-16 19:34:29,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 393. [2025-03-16 19:34:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.336870026525199) internal successors, (504), 392 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-16 19:34:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 504 transitions. [2025-03-16 19:34:29,932 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 504 transitions. Word has length 77 [2025-03-16 19:34:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:29,932 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 504 transitions. [2025-03-16 19:34:29,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 504 transitions. [2025-03-16 19:34:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:34:29,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:29,933 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-16 19:34:29,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:34:29,933 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:29,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:29,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2114801000, now seen corresponding path program 1 times [2025-03-16 19:34:29,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:29,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389302973] [2025-03-16 19:34:29,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:29,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:29,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:34:29,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:34:29,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:29,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:30,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:30,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389302973] [2025-03-16 19:34:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389302973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:30,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:30,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614889107] [2025-03-16 19:34:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:30,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:30,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:30,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:30,138 INFO L87 Difference]: Start difference. First operand 393 states and 504 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:30,671 INFO L93 Difference]: Finished difference Result 672 states and 876 transitions. [2025-03-16 19:34:30,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:30,671 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:30,673 INFO L225 Difference]: With dead ends: 672 [2025-03-16 19:34:30,673 INFO L226 Difference]: Without dead ends: 596 [2025-03-16 19:34:30,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:30,673 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1991 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1991 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:30,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1991 Valid, 1293 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-16 19:34:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2025-03-16 19:34:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3342175066312998) internal successors, (503), 392 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-16 19:34:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 503 transitions. [2025-03-16 19:34:30,679 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 503 transitions. Word has length 77 [2025-03-16 19:34:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:30,680 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 503 transitions. [2025-03-16 19:34:30,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 503 transitions. [2025-03-16 19:34:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:34:30,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:30,680 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-16 19:34:30,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:34:30,681 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:30,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:30,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1975655737, now seen corresponding path program 1 times [2025-03-16 19:34:30,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:30,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065219765] [2025-03-16 19:34:30,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:30,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:34:30,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:34:30,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:30,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:30,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:30,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065219765] [2025-03-16 19:34:30,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065219765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:30,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:30,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:30,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239887133] [2025-03-16 19:34:30,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:30,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:30,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:30,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:30,851 INFO L87 Difference]: Start difference. First operand 393 states and 503 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:31,354 INFO L93 Difference]: Finished difference Result 585 states and 742 transitions. [2025-03-16 19:34:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:31,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:31,356 INFO L225 Difference]: With dead ends: 585 [2025-03-16 19:34:31,356 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:31,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:31,357 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1976 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1976 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:31,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1976 Valid, 1251 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:31,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:31,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3315649867374004) internal successors, (502), 392 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-16 19:34:31,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 502 transitions. [2025-03-16 19:34:31,362 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 502 transitions. Word has length 77 [2025-03-16 19:34:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:31,362 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 502 transitions. [2025-03-16 19:34:31,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 502 transitions. [2025-03-16 19:34:31,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:34:31,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:31,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] [2025-03-16 19:34:31,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:34:31,363 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:31,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:31,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2144751653, now seen corresponding path program 1 times [2025-03-16 19:34:31,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:31,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599507720] [2025-03-16 19:34:31,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:31,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:31,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:34:31,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:34:31,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:31,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:31,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:31,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599507720] [2025-03-16 19:34:31,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599507720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:31,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:31,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:31,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728390561] [2025-03-16 19:34:31,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:31,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:31,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:31,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:31,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:31,568 INFO L87 Difference]: Start difference. First operand 393 states and 502 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:32,157 INFO L93 Difference]: Finished difference Result 668 states and 869 transitions. [2025-03-16 19:34:32,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:32,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:32,160 INFO L225 Difference]: With dead ends: 668 [2025-03-16 19:34:32,161 INFO L226 Difference]: Without dead ends: 596 [2025-03-16 19:34:32,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:32,162 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 1048 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:32,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1629 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-16 19:34:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2025-03-16 19:34:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3289124668435013) internal successors, (501), 392 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-16 19:34:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 501 transitions. [2025-03-16 19:34:32,168 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 501 transitions. Word has length 77 [2025-03-16 19:34:32,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:32,168 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 501 transitions. [2025-03-16 19:34:32,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 501 transitions. [2025-03-16 19:34:32,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:34:32,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:32,169 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-16 19:34:32,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:34:32,170 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-16 19:34:32,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash -107466558, now seen corresponding path program 1 times [2025-03-16 19:34:32,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:32,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252550476] [2025-03-16 19:34:32,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:32,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:32,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:34:32,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:34:32,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:32,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252550476] [2025-03-16 19:34:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252550476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:32,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:32,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:32,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842619685] [2025-03-16 19:34:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:32,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:32,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:32,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:32,329 INFO L87 Difference]: Start difference. First operand 393 states and 501 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:32,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:32,950 INFO L93 Difference]: Finished difference Result 751 states and 977 transitions. [2025-03-16 19:34:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:32,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:32,952 INFO L225 Difference]: With dead ends: 751 [2025-03-16 19:34:32,952 INFO L226 Difference]: Without dead ends: 608 [2025-03-16 19:34:32,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:32,953 INFO L435 NwaCegarLoop]: 396 mSDtfsCounter, 1702 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:32,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1702 Valid, 1683 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-16 19:34:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 393. [2025-03-16 19:34:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3262599469496021) internal successors, (500), 392 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-16 19:34:32,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 500 transitions. [2025-03-16 19:34:32,961 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 500 transitions. Word has length 77 [2025-03-16 19:34:32,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:32,961 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 500 transitions. [2025-03-16 19:34:32,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:32,961 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 500 transitions. [2025-03-16 19:34:32,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:34:32,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:32,962 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-16 19:34:32,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:34:32,963 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:32,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:32,963 INFO L85 PathProgramCache]: Analyzing trace with hash -527360344, now seen corresponding path program 1 times [2025-03-16 19:34:32,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:32,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091579552] [2025-03-16 19:34:32,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:32,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:34:32,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:34:32,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:32,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:33,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:33,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091579552] [2025-03-16 19:34:33,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091579552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:33,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:33,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:33,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905140088] [2025-03-16 19:34:33,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:33,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:33,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:33,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:33,144 INFO L87 Difference]: Start difference. First operand 393 states and 500 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:33,761 INFO L93 Difference]: Finished difference Result 698 states and 908 transitions. [2025-03-16 19:34:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:33,763 INFO L225 Difference]: With dead ends: 698 [2025-03-16 19:34:33,764 INFO L226 Difference]: Without dead ends: 600 [2025-03-16 19:34:33,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:33,765 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 1505 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:33,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1992 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-16 19:34:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 393. [2025-03-16 19:34:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.323607427055703) internal successors, (499), 392 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-16 19:34:33,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 499 transitions. [2025-03-16 19:34:33,771 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 499 transitions. Word has length 77 [2025-03-16 19:34:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:33,772 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 499 transitions. [2025-03-16 19:34:33,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:33,772 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 499 transitions. [2025-03-16 19:34:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:34:33,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:33,773 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-16 19:34:33,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:34:33,773 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:33,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash -300939147, now seen corresponding path program 1 times [2025-03-16 19:34:33,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:33,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753295076] [2025-03-16 19:34:33,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:33,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:33,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:34:33,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:34:33,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:33,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:34,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753295076] [2025-03-16 19:34:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753295076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:34,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:34,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106583408] [2025-03-16 19:34:34,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:34,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:34,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:34,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:34,010 INFO L87 Difference]: Start difference. First operand 393 states and 499 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:34,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:34,562 INFO L93 Difference]: Finished difference Result 672 states and 869 transitions. [2025-03-16 19:34:34,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:34,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:34,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:34,564 INFO L225 Difference]: With dead ends: 672 [2025-03-16 19:34:34,564 INFO L226 Difference]: Without dead ends: 596 [2025-03-16 19:34:34,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:34,566 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 1893 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1893 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:34,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1893 Valid, 1389 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-16 19:34:34,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 393. [2025-03-16 19:34:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.3209549071618036) internal successors, (498), 392 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-16 19:34:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 498 transitions. [2025-03-16 19:34:34,572 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 498 transitions. Word has length 77 [2025-03-16 19:34:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:34,572 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 498 transitions. [2025-03-16 19:34:34,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 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-16 19:34:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 498 transitions. [2025-03-16 19:34:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:34:34,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:34,573 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-16 19:34:34,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:34:34,573 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-16 19:34:34,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1518907339, now seen corresponding path program 1 times [2025-03-16 19:34:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377045715] [2025-03-16 19:34:34,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:34:34,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:34:34,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:34,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:34,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377045715] [2025-03-16 19:34:34,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377045715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:34,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:34,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:34,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930481050] [2025-03-16 19:34:34,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:34,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:34,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:34,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:34,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:34,729 INFO L87 Difference]: Start difference. First operand 393 states and 498 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 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-16 19:34:35,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:35,326 INFO L93 Difference]: Finished difference Result 698 states and 907 transitions. [2025-03-16 19:34:35,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:35,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 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-16 19:34:35,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:35,328 INFO L225 Difference]: With dead ends: 698 [2025-03-16 19:34:35,328 INFO L226 Difference]: Without dead ends: 600 [2025-03-16 19:34:35,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:35,329 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1527 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:35,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 1849 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-16 19:34:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 389. [2025-03-16 19:34:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.32171581769437) internal successors, (493), 388 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-16 19:34:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 493 transitions. [2025-03-16 19:34:35,333 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 493 transitions. Word has length 78 [2025-03-16 19:34:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:35,333 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 493 transitions. [2025-03-16 19:34:35,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 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-16 19:34:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 493 transitions. [2025-03-16 19:34:35,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:35,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:35,334 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-16 19:34:35,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:34:35,334 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:35,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:35,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1480520973, now seen corresponding path program 1 times [2025-03-16 19:34:35,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:35,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231922519] [2025-03-16 19:34:35,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:35,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:35,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:35,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:35,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:35,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:35,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:35,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231922519] [2025-03-16 19:34:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231922519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:35,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:35,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:35,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327160373] [2025-03-16 19:34:35,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:35,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:35,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:35,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:35,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:35,500 INFO L87 Difference]: Start difference. First operand 389 states and 493 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:36,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:36,010 INFO L93 Difference]: Finished difference Result 645 states and 827 transitions. [2025-03-16 19:34:36,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:36,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:36,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:36,012 INFO L225 Difference]: With dead ends: 645 [2025-03-16 19:34:36,012 INFO L226 Difference]: Without dead ends: 576 [2025-03-16 19:34:36,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:36,012 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 1551 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:36,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 1820 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-16 19:34:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2025-03-16 19:34:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3190348525469169) internal successors, (492), 388 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-16 19:34:36,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 492 transitions. [2025-03-16 19:34:36,018 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 492 transitions. Word has length 79 [2025-03-16 19:34:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:36,018 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 492 transitions. [2025-03-16 19:34:36,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 492 transitions. [2025-03-16 19:34:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:36,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:36,019 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-16 19:34:36,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:34:36,019 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:36,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:36,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1353392264, now seen corresponding path program 1 times [2025-03-16 19:34:36,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:36,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021535311] [2025-03-16 19:34:36,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:36,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:36,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:36,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:36,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021535311] [2025-03-16 19:34:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021535311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:36,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:36,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:36,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560591778] [2025-03-16 19:34:36,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:36,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:36,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:36,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:36,204 INFO L87 Difference]: Start difference. First operand 389 states and 492 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:36,639 INFO L93 Difference]: Finished difference Result 645 states and 826 transitions. [2025-03-16 19:34:36,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:36,639 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:36,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:36,641 INFO L225 Difference]: With dead ends: 645 [2025-03-16 19:34:36,641 INFO L226 Difference]: Without dead ends: 576 [2025-03-16 19:34:36,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:36,641 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 1895 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:36,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 1291 Invalid, 995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:34:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-16 19:34:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2025-03-16 19:34:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3163538873994638) internal successors, (491), 388 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-16 19:34:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 491 transitions. [2025-03-16 19:34:36,646 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 491 transitions. Word has length 79 [2025-03-16 19:34:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:36,646 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 491 transitions. [2025-03-16 19:34:36,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:36,646 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 491 transitions. [2025-03-16 19:34:36,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:36,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:36,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:36,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:34:36,647 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:36,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash -975656940, now seen corresponding path program 1 times [2025-03-16 19:34:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331584143] [2025-03-16 19:34:36,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:36,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:36,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:36,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:36,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:36,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:36,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:36,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331584143] [2025-03-16 19:34:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331584143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:36,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:36,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543679117] [2025-03-16 19:34:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:36,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:36,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:36,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:36,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:36,791 INFO L87 Difference]: Start difference. First operand 389 states and 491 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:37,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:37,244 INFO L93 Difference]: Finished difference Result 642 states and 821 transitions. [2025-03-16 19:34:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:37,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:37,246 INFO L225 Difference]: With dead ends: 642 [2025-03-16 19:34:37,246 INFO L226 Difference]: Without dead ends: 576 [2025-03-16 19:34:37,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:37,247 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 1080 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:37,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1616 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:37,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-16 19:34:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2025-03-16 19:34:37,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3136729222520107) internal successors, (490), 388 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 490 transitions. [2025-03-16 19:34:37,251 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 490 transitions. Word has length 79 [2025-03-16 19:34:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:37,252 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 490 transitions. [2025-03-16 19:34:37,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 490 transitions. [2025-03-16 19:34:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:37,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:37,253 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-16 19:34:37,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:34:37,253 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:37,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:37,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1177268697, now seen corresponding path program 1 times [2025-03-16 19:34:37,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:37,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704914410] [2025-03-16 19:34:37,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:37,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:37,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:37,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:37,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:37,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:37,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704914410] [2025-03-16 19:34:37,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704914410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:37,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:37,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:37,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884285582] [2025-03-16 19:34:37,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:37,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:37,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:37,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:37,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:37,422 INFO L87 Difference]: Start difference. First operand 389 states and 490 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:37,958 INFO L93 Difference]: Finished difference Result 668 states and 858 transitions. [2025-03-16 19:34:37,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:37,958 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:37,960 INFO L225 Difference]: With dead ends: 668 [2025-03-16 19:34:37,960 INFO L226 Difference]: Without dead ends: 592 [2025-03-16 19:34:37,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:37,961 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 1627 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:37,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 1648 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-16 19:34:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2025-03-16 19:34:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3109919571045576) internal successors, (489), 388 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 489 transitions. [2025-03-16 19:34:37,967 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 489 transitions. Word has length 79 [2025-03-16 19:34:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:37,967 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 489 transitions. [2025-03-16 19:34:37,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 489 transitions. [2025-03-16 19:34:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:37,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:37,968 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-16 19:34:37,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:34:37,968 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:37,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash 58084806, now seen corresponding path program 1 times [2025-03-16 19:34:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:37,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112380418] [2025-03-16 19:34:37,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:37,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:37,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:37,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112380418] [2025-03-16 19:34:38,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112380418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:38,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580395805] [2025-03-16 19:34:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:38,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:38,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:38,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:38,175 INFO L87 Difference]: Start difference. First operand 389 states and 489 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:38,736 INFO L93 Difference]: Finished difference Result 642 states and 819 transitions. [2025-03-16 19:34:38,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:38,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:38,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:38,738 INFO L225 Difference]: With dead ends: 642 [2025-03-16 19:34:38,738 INFO L226 Difference]: Without dead ends: 576 [2025-03-16 19:34:38,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:38,739 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 1538 mSDsluCounter, 1452 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:38,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 1870 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-16 19:34:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2025-03-16 19:34:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3083109919571045) internal successors, (488), 388 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:38,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 488 transitions. [2025-03-16 19:34:38,744 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 488 transitions. Word has length 79 [2025-03-16 19:34:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:38,744 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 488 transitions. [2025-03-16 19:34:38,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 488 transitions. [2025-03-16 19:34:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:38,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:38,745 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:38,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:34:38,745 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:38,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash 951303909, now seen corresponding path program 1 times [2025-03-16 19:34:38,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:38,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395633814] [2025-03-16 19:34:38,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:38,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:38,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:38,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:38,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:38,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:38,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:38,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395633814] [2025-03-16 19:34:38,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395633814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:38,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:38,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:38,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815067429] [2025-03-16 19:34:38,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:38,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:38,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:38,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:38,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:38,904 INFO L87 Difference]: Start difference. First operand 389 states and 488 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:39,359 INFO L93 Difference]: Finished difference Result 642 states and 818 transitions. [2025-03-16 19:34:39,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:39,359 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:39,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:39,361 INFO L225 Difference]: With dead ends: 642 [2025-03-16 19:34:39,361 INFO L226 Difference]: Without dead ends: 576 [2025-03-16 19:34:39,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:39,361 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1072 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:39,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1631 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:39,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-16 19:34:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2025-03-16 19:34:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3056300268096515) internal successors, (487), 388 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 487 transitions. [2025-03-16 19:34:39,365 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 487 transitions. Word has length 79 [2025-03-16 19:34:39,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:39,365 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 487 transitions. [2025-03-16 19:34:39,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 487 transitions. [2025-03-16 19:34:39,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:39,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:39,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] [2025-03-16 19:34:39,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:34:39,366 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:39,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:39,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2108558062, now seen corresponding path program 1 times [2025-03-16 19:34:39,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:39,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790604403] [2025-03-16 19:34:39,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:39,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:39,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:39,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:39,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:39,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:39,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790604403] [2025-03-16 19:34:39,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790604403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:39,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:39,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844711184] [2025-03-16 19:34:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:39,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:39,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:39,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:39,514 INFO L87 Difference]: Start difference. First operand 389 states and 487 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:39,948 INFO L93 Difference]: Finished difference Result 640 states and 814 transitions. [2025-03-16 19:34:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:39,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:39,950 INFO L225 Difference]: With dead ends: 640 [2025-03-16 19:34:39,950 INFO L226 Difference]: Without dead ends: 576 [2025-03-16 19:34:39,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:39,950 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 1534 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:39,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1644 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-16 19:34:39,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2025-03-16 19:34:39,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3029490616621984) internal successors, (486), 388 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-16 19:34:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 486 transitions. [2025-03-16 19:34:39,954 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 486 transitions. Word has length 79 [2025-03-16 19:34:39,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:39,955 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 486 transitions. [2025-03-16 19:34:39,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 486 transitions. [2025-03-16 19:34:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:39,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:39,955 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-16 19:34:39,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:34:39,956 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:39,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:39,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1610992311, now seen corresponding path program 1 times [2025-03-16 19:34:39,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:39,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907953103] [2025-03-16 19:34:39,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:39,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:39,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:39,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:39,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:39,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:40,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:40,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907953103] [2025-03-16 19:34:40,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907953103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:40,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:40,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:40,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236642103] [2025-03-16 19:34:40,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:40,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:40,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:40,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:40,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:40,160 INFO L87 Difference]: Start difference. First operand 389 states and 486 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:40,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:40,594 INFO L93 Difference]: Finished difference Result 642 states and 815 transitions. [2025-03-16 19:34:40,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:40,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:40,596 INFO L225 Difference]: With dead ends: 642 [2025-03-16 19:34:40,596 INFO L226 Difference]: Without dead ends: 576 [2025-03-16 19:34:40,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:40,596 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 1530 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:40,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1648 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-16 19:34:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2025-03-16 19:34:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.3002680965147453) internal successors, (485), 388 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 485 transitions. [2025-03-16 19:34:40,600 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 485 transitions. Word has length 79 [2025-03-16 19:34:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:40,600 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 485 transitions. [2025-03-16 19:34:40,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 485 transitions. [2025-03-16 19:34:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:40,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:40,601 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-16 19:34:40,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:34:40,601 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:40,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1988909323, now seen corresponding path program 1 times [2025-03-16 19:34:40,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117843666] [2025-03-16 19:34:40,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:40,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:40,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:40,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:40,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:40,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:40,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-16 19:34:40,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:40,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117843666] [2025-03-16 19:34:40,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117843666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:40,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:40,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:40,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529085655] [2025-03-16 19:34:40,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:40,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:40,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:40,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:40,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:40,733 INFO L87 Difference]: Start difference. First operand 389 states and 485 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:41,182 INFO L93 Difference]: Finished difference Result 581 states and 721 transitions. [2025-03-16 19:34:41,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:41,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:41,184 INFO L225 Difference]: With dead ends: 581 [2025-03-16 19:34:41,184 INFO L226 Difference]: Without dead ends: 576 [2025-03-16 19:34:41,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:41,184 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 1846 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1846 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:41,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1846 Valid, 1323 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2025-03-16 19:34:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 389. [2025-03-16 19:34:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 373 states have (on average 1.2975871313672922) internal successors, (484), 388 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-16 19:34:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 484 transitions. [2025-03-16 19:34:41,188 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 484 transitions. Word has length 79 [2025-03-16 19:34:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:41,188 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 484 transitions. [2025-03-16 19:34:41,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 484 transitions. [2025-03-16 19:34:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:41,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:41,189 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-16 19:34:41,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 19:34:41,189 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:41,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1215947128, now seen corresponding path program 1 times [2025-03-16 19:34:41,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:41,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319273608] [2025-03-16 19:34:41,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:41,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:41,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:41,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:41,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:41,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:41,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319273608] [2025-03-16 19:34:41,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319273608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:34:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326602621] [2025-03-16 19:34:41,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:41,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:34:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:41,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:34:41,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:34:41,427 INFO L87 Difference]: Start difference. First operand 389 states and 484 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 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-16 19:34:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:42,191 INFO L93 Difference]: Finished difference Result 811 states and 1056 transitions. [2025-03-16 19:34:42,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 19:34:42,191 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 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-16 19:34:42,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:42,193 INFO L225 Difference]: With dead ends: 811 [2025-03-16 19:34:42,193 INFO L226 Difference]: Without dead ends: 794 [2025-03-16 19:34:42,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:34:42,194 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 3899 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3899 SdHoareTripleChecker+Valid, 1939 SdHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:42,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3899 Valid, 1939 Invalid, 1540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:34:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-03-16 19:34:42,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 393. [2025-03-16 19:34:42,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2944297082228118) internal successors, (488), 392 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 488 transitions. [2025-03-16 19:34:42,198 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 488 transitions. Word has length 79 [2025-03-16 19:34:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:42,198 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 488 transitions. [2025-03-16 19:34:42,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 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-16 19:34:42,199 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 488 transitions. [2025-03-16 19:34:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:42,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:42,199 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-16 19:34:42,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 19:34:42,199 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:42,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:42,200 INFO L85 PathProgramCache]: Analyzing trace with hash 845003914, now seen corresponding path program 1 times [2025-03-16 19:34:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:42,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482245935] [2025-03-16 19:34:42,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:42,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:42,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:42,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:42,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:42,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482245935] [2025-03-16 19:34:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482245935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:42,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:42,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:42,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277824844] [2025-03-16 19:34:42,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:42,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:42,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:42,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:42,330 INFO L87 Difference]: Start difference. First operand 393 states and 488 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:42,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:42,705 INFO L93 Difference]: Finished difference Result 585 states and 723 transitions. [2025-03-16 19:34:42,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:42,706 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:42,707 INFO L225 Difference]: With dead ends: 585 [2025-03-16 19:34:42,707 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:42,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:42,708 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 1493 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:42,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 1360 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:34:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:42,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2917771883289124) internal successors, (487), 392 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 487 transitions. [2025-03-16 19:34:42,712 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 487 transitions. Word has length 79 [2025-03-16 19:34:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:42,712 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 487 transitions. [2025-03-16 19:34:42,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 487 transitions. [2025-03-16 19:34:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:42,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:42,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:42,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 19:34:42,713 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1225294146, now seen corresponding path program 1 times [2025-03-16 19:34:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927819559] [2025-03-16 19:34:42,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:42,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:42,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:42,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:42,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:42,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:42,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927819559] [2025-03-16 19:34:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927819559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:42,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:42,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:42,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462883614] [2025-03-16 19:34:42,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:42,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:42,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:42,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:42,843 INFO L87 Difference]: Start difference. First operand 393 states and 487 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:43,322 INFO L93 Difference]: Finished difference Result 708 states and 903 transitions. [2025-03-16 19:34:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:43,324 INFO L225 Difference]: With dead ends: 708 [2025-03-16 19:34:43,324 INFO L226 Difference]: Without dead ends: 604 [2025-03-16 19:34:43,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:43,325 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1494 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 1849 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:43,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 1849 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-16 19:34:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 393. [2025-03-16 19:34:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2891246684350133) internal successors, (486), 392 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-16 19:34:43,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 486 transitions. [2025-03-16 19:34:43,329 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 486 transitions. Word has length 79 [2025-03-16 19:34:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:43,329 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 486 transitions. [2025-03-16 19:34:43,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 486 transitions. [2025-03-16 19:34:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:43,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:43,330 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-16 19:34:43,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 19:34:43,330 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:43,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:43,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1855476548, now seen corresponding path program 1 times [2025-03-16 19:34:43,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:43,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862766512] [2025-03-16 19:34:43,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:43,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:43,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:43,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:43,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:43,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:43,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:43,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862766512] [2025-03-16 19:34:43,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862766512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:43,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:43,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:43,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645157053] [2025-03-16 19:34:43,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:43,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:43,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:43,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:43,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:43,460 INFO L87 Difference]: Start difference. First operand 393 states and 486 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:43,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:43,931 INFO L93 Difference]: Finished difference Result 673 states and 852 transitions. [2025-03-16 19:34:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:43,931 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:43,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:43,933 INFO L225 Difference]: With dead ends: 673 [2025-03-16 19:34:43,933 INFO L226 Difference]: Without dead ends: 592 [2025-03-16 19:34:43,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:43,934 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 1677 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:43,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 1633 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:43,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-16 19:34:43,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 393. [2025-03-16 19:34:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 377 states have (on average 1.2864721485411141) internal successors, (485), 392 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 485 transitions. [2025-03-16 19:34:43,938 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 485 transitions. Word has length 79 [2025-03-16 19:34:43,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:43,938 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 485 transitions. [2025-03-16 19:34:43,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:43,939 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 485 transitions. [2025-03-16 19:34:43,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:43,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:43,939 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-16 19:34:43,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 19:34:43,939 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:43,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash -378539706, now seen corresponding path program 1 times [2025-03-16 19:34:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:43,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679262967] [2025-03-16 19:34:43,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:43,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:43,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:43,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:43,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:43,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:44,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:44,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679262967] [2025-03-16 19:34:44,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679262967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:44,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:44,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:44,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893389841] [2025-03-16 19:34:44,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:44,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:44,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:44,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:44,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:44,098 INFO L87 Difference]: Start difference. First operand 393 states and 485 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:44,573 INFO L93 Difference]: Finished difference Result 649 states and 816 transitions. [2025-03-16 19:34:44,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:34:44,574 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:44,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:44,576 INFO L225 Difference]: With dead ends: 649 [2025-03-16 19:34:44,576 INFO L226 Difference]: Without dead ends: 580 [2025-03-16 19:34:44,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-16 19:34:44,576 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 1510 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:44,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 1908 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:44,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-16 19:34:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 393. [2025-03-16 19:34:44,580 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-16 19:34:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 484 transitions. [2025-03-16 19:34:44,580 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 484 transitions. Word has length 79 [2025-03-16 19:34:44,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:44,580 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 484 transitions. [2025-03-16 19:34:44,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 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-16 19:34:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 484 transitions. [2025-03-16 19:34:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:34:44,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:44,581 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-16 19:34:44,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 19:34:44,581 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:44,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash -353786618, now seen corresponding path program 1 times [2025-03-16 19:34:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:44,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924724708] [2025-03-16 19:34:44,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:44,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:34:44,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:34:44,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:44,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:44,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924724708] [2025-03-16 19:34:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924724708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:44,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:44,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332029523] [2025-03-16 19:34:44,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:44,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:44,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:44,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:44,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:44,712 INFO L87 Difference]: Start difference. First operand 393 states and 484 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-16 19:34:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:45,167 INFO L93 Difference]: Finished difference Result 609 states and 754 transitions. [2025-03-16 19:34:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:45,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-16 19:34:45,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:45,169 INFO L225 Difference]: With dead ends: 609 [2025-03-16 19:34:45,169 INFO L226 Difference]: Without dead ends: 592 [2025-03-16 19:34:45,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:45,169 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 1007 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:45,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1007 Valid, 1820 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:34:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-03-16 19:34:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 389. [2025-03-16 19:34:45,176 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-16 19:34:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 479 transitions. [2025-03-16 19:34:45,176 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 479 transitions. Word has length 80 [2025-03-16 19:34:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:45,177 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 479 transitions. [2025-03-16 19:34:45,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 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-16 19:34:45,177 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 479 transitions. [2025-03-16 19:34:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:34:45,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:45,177 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-16 19:34:45,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-16 19:34:45,178 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:45,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1830447179, now seen corresponding path program 1 times [2025-03-16 19:34:45,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:45,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773011555] [2025-03-16 19:34:45,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:45,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:34:45,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:34:45,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:45,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:45,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773011555] [2025-03-16 19:34:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773011555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:45,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:45,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 19:34:45,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043602894] [2025-03-16 19:34:45,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:45,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 19:34:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:45,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 19:34:45,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:34:45,551 INFO L87 Difference]: Start difference. First operand 389 states and 479 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 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-16 19:34:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:46,023 INFO L93 Difference]: Finished difference Result 898 states and 1130 transitions. [2025-03-16 19:34:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:46,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 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-16 19:34:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:46,025 INFO L225 Difference]: With dead ends: 898 [2025-03-16 19:34:46,025 INFO L226 Difference]: Without dead ends: 717 [2025-03-16 19:34:46,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:34:46,026 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 1500 mSDsluCounter, 2917 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 3610 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:46,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 3610 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:34:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2025-03-16 19:34:46,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 272. [2025-03-16 19:34:46,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 261 states have (on average 1.2720306513409962) internal successors, (332), 271 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:46,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 332 transitions. [2025-03-16 19:34:46,029 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 332 transitions. Word has length 81 [2025-03-16 19:34:46,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:46,029 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 332 transitions. [2025-03-16 19:34:46,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 10 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-16 19:34:46,029 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 332 transitions. [2025-03-16 19:34:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:34:46,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:46,030 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-16 19:34:46,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-16 19:34:46,030 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:46,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2056363433, now seen corresponding path program 1 times [2025-03-16 19:34:46,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:46,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538250681] [2025-03-16 19:34:46,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:46,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:46,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:34:46,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:34:46,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:46,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:46,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:46,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538250681] [2025-03-16 19:34:46,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538250681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:46,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:46,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:34:46,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932925375] [2025-03-16 19:34:46,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:46,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:34:46,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:46,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:34:46,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:34:46,379 INFO L87 Difference]: Start difference. First operand 272 states and 332 transitions. Second operand has 12 states, 12 states have (on average 6.75) 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-16 19:34:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:46,750 INFO L93 Difference]: Finished difference Result 480 states and 617 transitions. [2025-03-16 19:34:46,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:46,750 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) 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-16 19:34:46,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:46,751 INFO L225 Difference]: With dead ends: 480 [2025-03-16 19:34:46,751 INFO L226 Difference]: Without dead ends: 392 [2025-03-16 19:34:46,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:34:46,752 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1345 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1345 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:46,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1345 Valid, 1899 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-03-16 19:34:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 248. [2025-03-16 19:34:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 238 states have (on average 1.26890756302521) internal successors, (302), 247 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 302 transitions. [2025-03-16 19:34:46,754 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 302 transitions. Word has length 81 [2025-03-16 19:34:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:46,754 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 302 transitions. [2025-03-16 19:34:46,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) 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-16 19:34:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 302 transitions. [2025-03-16 19:34:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:34:46,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:46,755 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-16 19:34:46,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-16 19:34:46,755 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:46,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:46,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1511516173, now seen corresponding path program 1 times [2025-03-16 19:34:46,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:46,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921509988] [2025-03-16 19:34:46,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:46,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:46,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:34:46,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:34:46,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:46,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:47,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:47,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921509988] [2025-03-16 19:34:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921509988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:47,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:34:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470313050] [2025-03-16 19:34:47,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:47,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:34:47,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:47,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:34:47,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:47,246 INFO L87 Difference]: Start difference. First operand 248 states and 302 transitions. Second operand has 13 states, 13 states have (on average 6.230769230769231) 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-16 19:34:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:47,821 INFO L93 Difference]: Finished difference Result 661 states and 857 transitions. [2025-03-16 19:34:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:34:47,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.230769230769231) 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-16 19:34:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:47,823 INFO L225 Difference]: With dead ends: 661 [2025-03-16 19:34:47,823 INFO L226 Difference]: Without dead ends: 586 [2025-03-16 19:34:47,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:34:47,823 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1825 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1825 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:47,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1825 Valid, 2943 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:47,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-03-16 19:34:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 237. [2025-03-16 19:34:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 228 states have (on average 1.2675438596491229) internal successors, (289), 236 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 289 transitions. [2025-03-16 19:34:47,827 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 289 transitions. Word has length 81 [2025-03-16 19:34:47,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:47,827 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 289 transitions. [2025-03-16 19:34:47,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) 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-16 19:34:47,827 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 289 transitions. [2025-03-16 19:34:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:34:47,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:47,827 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-16 19:34:47,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-16 19:34:47,828 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:47,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash 983873896, now seen corresponding path program 1 times [2025-03-16 19:34:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746887042] [2025-03-16 19:34:47,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:47,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:47,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:34:47,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:34:47,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:47,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:48,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:48,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746887042] [2025-03-16 19:34:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746887042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:48,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-16 19:34:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299663182] [2025-03-16 19:34:48,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:48,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 19:34:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:48,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 19:34:48,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:34:48,649 INFO L87 Difference]: Start difference. First operand 237 states and 289 transitions. Second operand has 20 states, 20 states have (on average 4.05) internal successors, (81), 19 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-16 19:34:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:50,373 INFO L93 Difference]: Finished difference Result 684 states and 863 transitions. [2025-03-16 19:34:50,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 19:34:50,374 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 19 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-16 19:34:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:50,375 INFO L225 Difference]: With dead ends: 684 [2025-03-16 19:34:50,376 INFO L226 Difference]: Without dead ends: 660 [2025-03-16 19:34:50,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=1079, Unknown=0, NotChecked=0, Total=1332 [2025-03-16 19:34:50,377 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 2463 mSDsluCounter, 6661 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2463 SdHoareTripleChecker+Valid, 7231 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:50,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2463 Valid, 7231 Invalid, 2205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2203 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:34:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-03-16 19:34:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 246. [2025-03-16 19:34:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 237 states have (on average 1.2658227848101267) internal successors, (300), 245 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 300 transitions. [2025-03-16 19:34:50,381 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 300 transitions. Word has length 81 [2025-03-16 19:34:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:50,381 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 300 transitions. [2025-03-16 19:34:50,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 19 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-16 19:34:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 300 transitions. [2025-03-16 19:34:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:34:50,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:50,381 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-16 19:34:50,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-16 19:34:50,382 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:50,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:50,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1979520644, now seen corresponding path program 1 times [2025-03-16 19:34:50,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:50,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775993826] [2025-03-16 19:34:50,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:50,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:50,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:34:50,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:34:50,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:50,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:50,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:50,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775993826] [2025-03-16 19:34:50,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775993826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:50,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:34:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486743451] [2025-03-16 19:34:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:50,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:34:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:50,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:34:50,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:34:50,748 INFO L87 Difference]: Start difference. First operand 246 states and 300 transitions. Second operand has 12 states, 12 states have (on average 6.75) 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-16 19:34:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:51,168 INFO L93 Difference]: Finished difference Result 425 states and 546 transitions. [2025-03-16 19:34:51,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:34:51,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) 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-16 19:34:51,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:51,169 INFO L225 Difference]: With dead ends: 425 [2025-03-16 19:34:51,169 INFO L226 Difference]: Without dead ends: 357 [2025-03-16 19:34:51,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:34:51,170 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 1305 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1305 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:51,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1305 Valid, 1767 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-16 19:34:51,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 242. [2025-03-16 19:34:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 234 states have (on average 1.2606837606837606) internal successors, (295), 241 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 295 transitions. [2025-03-16 19:34:51,172 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 295 transitions. Word has length 81 [2025-03-16 19:34:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:51,173 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 295 transitions. [2025-03-16 19:34:51,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) 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-16 19:34:51,173 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 295 transitions. [2025-03-16 19:34:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:34:51,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:51,173 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-16 19:34:51,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-16 19:34:51,173 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:51,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1787702065, now seen corresponding path program 1 times [2025-03-16 19:34:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:51,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506478347] [2025-03-16 19:34:51,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:51,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:51,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:34:51,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:34:51,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:51,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:51,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:51,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506478347] [2025-03-16 19:34:51,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506478347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:51,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:51,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:34:51,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895865059] [2025-03-16 19:34:51,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:51,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:34:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:51,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:34:51,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:34:51,519 INFO L87 Difference]: Start difference. First operand 242 states and 295 transitions. Second operand has 12 states, 12 states have (on average 6.75) 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-16 19:34:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:51,896 INFO L93 Difference]: Finished difference Result 421 states and 540 transitions. [2025-03-16 19:34:51,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:34:51,897 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) 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-16 19:34:51,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:51,898 INFO L225 Difference]: With dead ends: 421 [2025-03-16 19:34:51,898 INFO L226 Difference]: Without dead ends: 356 [2025-03-16 19:34:51,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:34:51,902 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1530 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:51,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1644 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-16 19:34:51,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 241. [2025-03-16 19:34:51,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 233 states have (on average 1.257510729613734) internal successors, (293), 240 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2025-03-16 19:34:51,905 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 81 [2025-03-16 19:34:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:51,905 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2025-03-16 19:34:51,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) 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-16 19:34:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2025-03-16 19:34:51,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:34:51,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:51,906 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-16 19:34:51,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-16 19:34:51,906 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:51,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2051737722, now seen corresponding path program 1 times [2025-03-16 19:34:51,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:51,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712359686] [2025-03-16 19:34:51,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:51,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:51,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:34:51,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:34:51,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:51,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:52,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:52,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712359686] [2025-03-16 19:34:52,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712359686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:52,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:52,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-16 19:34:52,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111666455] [2025-03-16 19:34:52,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:52,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 19:34:52,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:52,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 19:34:52,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:34:52,198 INFO L87 Difference]: Start difference. First operand 241 states and 293 transitions. Second operand has 12 states, 12 states have (on average 6.75) 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-16 19:34:52,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:52,598 INFO L93 Difference]: Finished difference Result 416 states and 539 transitions. [2025-03-16 19:34:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:34:52,598 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) 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-16 19:34:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:52,599 INFO L225 Difference]: With dead ends: 416 [2025-03-16 19:34:52,599 INFO L226 Difference]: Without dead ends: 324 [2025-03-16 19:34:52,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:34:52,600 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1147 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 2291 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:52,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 2291 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-16 19:34:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 213. [2025-03-16 19:34:52,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.2560386473429952) internal successors, (260), 212 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 260 transitions. [2025-03-16 19:34:52,602 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 260 transitions. Word has length 81 [2025-03-16 19:34:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:52,602 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 260 transitions. [2025-03-16 19:34:52,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) 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-16 19:34:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 260 transitions. [2025-03-16 19:34:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:34:52,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:52,603 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:52,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-16 19:34:52,603 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:52,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:52,603 INFO L85 PathProgramCache]: Analyzing trace with hash 601890178, now seen corresponding path program 1 times [2025-03-16 19:34:52,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:52,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22238139] [2025-03-16 19:34:52,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:52,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:34:52,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:34:52,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:52,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:53,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:53,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22238139] [2025-03-16 19:34:53,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22238139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:53,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:53,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-03-16 19:34:53,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917350000] [2025-03-16 19:34:53,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:53,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 19:34:53,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:53,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 19:34:53,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2025-03-16 19:34:53,724 INFO L87 Difference]: Start difference. First operand 213 states and 260 transitions. Second operand has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 28 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-16 19:34:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:55,973 INFO L93 Difference]: Finished difference Result 861 states and 1129 transitions. [2025-03-16 19:34:55,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-16 19:34:55,973 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 28 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-16 19:34:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:55,975 INFO L225 Difference]: With dead ends: 861 [2025-03-16 19:34:55,975 INFO L226 Difference]: Without dead ends: 793 [2025-03-16 19:34:55,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=404, Invalid=2248, Unknown=0, NotChecked=0, Total=2652 [2025-03-16 19:34:55,976 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 2565 mSDsluCounter, 6174 mSDsCounter, 0 mSdLazyCounter, 3626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2565 SdHoareTripleChecker+Valid, 6650 SdHoareTripleChecker+Invalid, 3630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:55,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2565 Valid, 6650 Invalid, 3630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3626 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:34:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-03-16 19:34:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 228. [2025-03-16 19:34:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 227 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 281 transitions. [2025-03-16 19:34:55,979 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 281 transitions. Word has length 81 [2025-03-16 19:34:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:55,979 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 281 transitions. [2025-03-16 19:34:55,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 28 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-16 19:34:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 281 transitions. [2025-03-16 19:34:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:34:55,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:55,980 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-16 19:34:55,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-16 19:34:55,980 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:55,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:55,981 INFO L85 PathProgramCache]: Analyzing trace with hash -164643269, now seen corresponding path program 1 times [2025-03-16 19:34:55,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:55,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613103978] [2025-03-16 19:34:55,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:55,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:34:56,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:34:56,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:56,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:56,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:56,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613103978] [2025-03-16 19:34:56,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613103978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:56,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:56,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 19:34:56,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253496086] [2025-03-16 19:34:56,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:56,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 19:34:56,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:56,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 19:34:56,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:34:56,198 INFO L87 Difference]: Start difference. First operand 228 states and 281 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 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-16 19:34:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:56,393 INFO L93 Difference]: Finished difference Result 339 states and 431 transitions. [2025-03-16 19:34:56,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:56,393 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 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-16 19:34:56,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:56,394 INFO L225 Difference]: With dead ends: 339 [2025-03-16 19:34:56,394 INFO L226 Difference]: Without dead ends: 308 [2025-03-16 19:34:56,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:34:56,395 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 599 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:56,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1354 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-03-16 19:34:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 196. [2025-03-16 19:34:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 192 states have (on average 1.2708333333333333) internal successors, (244), 195 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 244 transitions. [2025-03-16 19:34:56,397 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 244 transitions. Word has length 82 [2025-03-16 19:34:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:56,397 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 244 transitions. [2025-03-16 19:34:56,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 9 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-16 19:34:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 244 transitions. [2025-03-16 19:34:56,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:34:56,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:56,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:56,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-16 19:34:56,398 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:56,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash -546626987, now seen corresponding path program 1 times [2025-03-16 19:34:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644008042] [2025-03-16 19:34:56,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:56,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:56,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:34:56,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:34:56,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:56,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:56,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:56,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:56,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644008042] [2025-03-16 19:34:56,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644008042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:56,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:56,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-16 19:34:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997134538] [2025-03-16 19:34:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:56,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:34:56,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:56,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:34:56,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:56,747 INFO L87 Difference]: Start difference. First operand 196 states and 244 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:57,205 INFO L93 Difference]: Finished difference Result 515 states and 696 transitions. [2025-03-16 19:34:57,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:34:57,205 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-16 19:34:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:57,206 INFO L225 Difference]: With dead ends: 515 [2025-03-16 19:34:57,206 INFO L226 Difference]: Without dead ends: 431 [2025-03-16 19:34:57,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-16 19:34:57,207 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 1277 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1277 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:57,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1277 Valid, 1806 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:57,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-16 19:34:57,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 160. [2025-03-16 19:34:57,209 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-16 19:34:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 198 transitions. [2025-03-16 19:34:57,209 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 198 transitions. Word has length 82 [2025-03-16 19:34:57,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:57,209 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 198 transitions. [2025-03-16 19:34:57,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions. [2025-03-16 19:34:57,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:34:57,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:57,210 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-16 19:34:57,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-16 19:34:57,210 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:57,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash -264448250, now seen corresponding path program 1 times [2025-03-16 19:34:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:57,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52467406] [2025-03-16 19:34:57,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:57,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:34:57,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:34:57,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:57,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:57,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:57,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52467406] [2025-03-16 19:34:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52467406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:57,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:57,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:34:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843944687] [2025-03-16 19:34:57,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:57,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:57,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:57,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:57,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:57,323 INFO L87 Difference]: Start difference. First operand 160 states and 198 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 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-16 19:34:57,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:57,542 INFO L93 Difference]: Finished difference Result 333 states and 439 transitions. [2025-03-16 19:34:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:57,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 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-16 19:34:57,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:57,543 INFO L225 Difference]: With dead ends: 333 [2025-03-16 19:34:57,543 INFO L226 Difference]: Without dead ends: 251 [2025-03-16 19:34:57,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:34:57,544 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 410 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:57,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 763 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:34:57,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-16 19:34:57,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 160. [2025-03-16 19:34:57,546 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-16 19:34:57,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 197 transitions. [2025-03-16 19:34:57,546 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 197 transitions. Word has length 82 [2025-03-16 19:34:57,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:57,546 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 197 transitions. [2025-03-16 19:34:57,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 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-16 19:34:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 197 transitions. [2025-03-16 19:34:57,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:34:57,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:57,546 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-16 19:34:57,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-16 19:34:57,547 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:34:57,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:57,547 INFO L85 PathProgramCache]: Analyzing trace with hash -929321946, now seen corresponding path program 1 times [2025-03-16 19:34:57,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:57,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806189972] [2025-03-16 19:34:57,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:57,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:34:57,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:34:57,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:57,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:58,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:58,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806189972] [2025-03-16 19:34:58,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806189972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:58,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:58,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-03-16 19:34:58,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010798155] [2025-03-16 19:34:58,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:58,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:34:58,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:58,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:34:58,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:34:58,588 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), 27 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-16 19:35:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:01,324 INFO L93 Difference]: Finished difference Result 623 states and 833 transitions. [2025-03-16 19:35:01,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-16 19:35:01,324 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 27 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-16 19:35:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:01,326 INFO L225 Difference]: With dead ends: 623 [2025-03-16 19:35:01,326 INFO L226 Difference]: Without dead ends: 617 [2025-03-16 19:35:01,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=344, Invalid=2106, Unknown=0, NotChecked=0, Total=2450 [2025-03-16 19:35:01,327 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 1530 mSDsluCounter, 8910 mSDsCounter, 0 mSdLazyCounter, 4729 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 9433 SdHoareTripleChecker+Invalid, 4729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:01,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 9433 Invalid, 4729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4729 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 19:35:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-16 19:35:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 181. [2025-03-16 19:35:01,329 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-16 19:35:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 223 transitions. [2025-03-16 19:35:01,329 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 223 transitions. Word has length 84 [2025-03-16 19:35:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:01,329 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 223 transitions. [2025-03-16 19:35:01,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0) internal successors, (84), 27 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-16 19:35:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 223 transitions. [2025-03-16 19:35:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:35:01,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:01,330 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-16 19:35:01,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-16 19:35:01,330 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:01,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:01,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1600262771, now seen corresponding path program 1 times [2025-03-16 19:35:01,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:01,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016621225] [2025-03-16 19:35:01,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:01,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:35:01,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:35:01,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:01,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:01,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-16 19:35:01,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:01,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016621225] [2025-03-16 19:35:01,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016621225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:01,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:01,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 19:35:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268348944] [2025-03-16 19:35:01,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:01,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 19:35:01,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:01,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 19:35:01,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:35:01,913 INFO L87 Difference]: Start difference. First operand 181 states and 223 transitions. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 15 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-16 19:35:02,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:02,993 INFO L93 Difference]: Finished difference Result 579 states and 785 transitions. [2025-03-16 19:35:02,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 19:35:02,994 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 15 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-16 19:35:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:02,995 INFO L225 Difference]: With dead ends: 579 [2025-03-16 19:35:02,995 INFO L226 Difference]: Without dead ends: 573 [2025-03-16 19:35:02,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=899, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 19:35:02,996 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 1263 mSDsluCounter, 4299 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 4743 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:02,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1263 Valid, 4743 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 19:35:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-16 19:35:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 194. [2025-03-16 19:35:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 192 states have (on average 1.2395833333333333) internal successors, (238), 193 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 238 transitions. [2025-03-16 19:35:02,998 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 238 transitions. Word has length 85 [2025-03-16 19:35:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:02,998 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 238 transitions. [2025-03-16 19:35:02,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 15 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-16 19:35:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 238 transitions. [2025-03-16 19:35:02,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:35:02,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:02,999 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-16 19:35:02,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-16 19:35:02,999 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:02,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:02,999 INFO L85 PathProgramCache]: Analyzing trace with hash 738394339, now seen corresponding path program 1 times [2025-03-16 19:35:02,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:02,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030339986] [2025-03-16 19:35:02,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:02,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:03,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:35:03,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:35:03,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:03,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030339986] [2025-03-16 19:35:03,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030339986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:03,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:03,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-16 19:35:03,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230008972] [2025-03-16 19:35:03,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:03,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 19:35:03,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:03,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 19:35:03,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-16 19:35:03,527 INFO L87 Difference]: Start difference. First operand 194 states and 238 transitions. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 15 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-16 19:35:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:04,254 INFO L93 Difference]: Finished difference Result 354 states and 467 transitions. [2025-03-16 19:35:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 19:35:04,254 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 15 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-16 19:35:04,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:04,255 INFO L225 Difference]: With dead ends: 354 [2025-03-16 19:35:04,255 INFO L226 Difference]: Without dead ends: 348 [2025-03-16 19:35:04,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:35:04,256 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 1396 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:04,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 1958 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:35:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-16 19:35:04,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 154. [2025-03-16 19:35:04,257 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-16 19:35:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 191 transitions. [2025-03-16 19:35:04,258 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 191 transitions. Word has length 85 [2025-03-16 19:35:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:04,258 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 191 transitions. [2025-03-16 19:35:04,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 15 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-16 19:35:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 191 transitions. [2025-03-16 19:35:04,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:35:04,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:04,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:35:04,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-16 19:35:04,258 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:04,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1564828814, now seen corresponding path program 1 times [2025-03-16 19:35:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706461991] [2025-03-16 19:35:04,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:04,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:04,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:35:04,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:35:04,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:04,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:04,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:04,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:04,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706461991] [2025-03-16 19:35:04,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706461991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:04,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:04,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:04,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623677871] [2025-03-16 19:35:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:04,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:04,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:04,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:04,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:04,335 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-16 19:35:04,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:04,433 INFO L93 Difference]: Finished difference Result 794 states and 1141 transitions. [2025-03-16 19:35:04,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:35:04,433 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-16 19:35:04,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:04,435 INFO L225 Difference]: With dead ends: 794 [2025-03-16 19:35:04,435 INFO L226 Difference]: Without dead ends: 730 [2025-03-16 19:35:04,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:35:04,435 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 1250 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:04,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 1837 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-16 19:35:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 216. [2025-03-16 19:35:04,438 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-16 19:35:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 283 transitions. [2025-03-16 19:35:04,439 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 283 transitions. Word has length 111 [2025-03-16 19:35:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:04,439 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 283 transitions. [2025-03-16 19:35:04,439 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-16 19:35:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 283 transitions. [2025-03-16 19:35:04,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:35:04,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:04,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:35:04,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-16 19:35:04,439 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:04,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:04,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1824256682, now seen corresponding path program 1 times [2025-03-16 19:35:04,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:04,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54700490] [2025-03-16 19:35:04,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:04,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:35:04,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:35:04,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:04,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:04,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:04,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54700490] [2025-03-16 19:35:04,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54700490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:04,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:04,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:04,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941230700] [2025-03-16 19:35:04,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:04,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:04,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:04,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:04,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:04,530 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-16 19:35:04,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:04,601 INFO L93 Difference]: Finished difference Result 910 states and 1311 transitions. [2025-03-16 19:35:04,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:04,601 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-16 19:35:04,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:04,602 INFO L225 Difference]: With dead ends: 910 [2025-03-16 19:35:04,602 INFO L226 Difference]: Without dead ends: 784 [2025-03-16 19:35:04,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:04,603 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 949 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:04,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1197 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2025-03-16 19:35:04,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 340. [2025-03-16 19:35:04,607 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-16 19:35:04,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 468 transitions. [2025-03-16 19:35:04,607 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 468 transitions. Word has length 113 [2025-03-16 19:35:04,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:04,607 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 468 transitions. [2025-03-16 19:35:04,607 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-16 19:35:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 468 transitions. [2025-03-16 19:35:04,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:35:04,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:04,608 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-16 19:35:04,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-16 19:35:04,608 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:04,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:04,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1687903818, now seen corresponding path program 1 times [2025-03-16 19:35:04,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:04,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115909631] [2025-03-16 19:35:04,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:04,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:04,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:35:04,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:35:04,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:04,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:04,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:04,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115909631] [2025-03-16 19:35:04,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115909631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:04,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:04,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:04,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106663015] [2025-03-16 19:35:04,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:04,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:04,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:04,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:04,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:04,687 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-16 19:35:04,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:04,759 INFO L93 Difference]: Finished difference Result 1034 states and 1496 transitions. [2025-03-16 19:35:04,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:04,759 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-16 19:35:04,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:04,761 INFO L225 Difference]: With dead ends: 1034 [2025-03-16 19:35:04,761 INFO L226 Difference]: Without dead ends: 908 [2025-03-16 19:35:04,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:04,761 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 989 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:04,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 1089 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:04,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-03-16 19:35:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 526. [2025-03-16 19:35:04,768 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-16 19:35:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 745 transitions. [2025-03-16 19:35:04,768 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 745 transitions. Word has length 113 [2025-03-16 19:35:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:04,769 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 745 transitions. [2025-03-16 19:35:04,769 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-16 19:35:04,769 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 745 transitions. [2025-03-16 19:35:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:35:04,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:04,769 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-16 19:35:04,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-16 19:35:04,769 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:04,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash -683566614, now seen corresponding path program 1 times [2025-03-16 19:35:04,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:04,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702878697] [2025-03-16 19:35:04,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:04,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:04,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:35:04,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:35:04,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:04,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:04,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:04,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702878697] [2025-03-16 19:35:04,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702878697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:04,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:04,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:04,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580960262] [2025-03-16 19:35:04,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:04,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:04,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:04,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:04,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:04,853 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-16 19:35:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:04,937 INFO L93 Difference]: Finished difference Result 1158 states and 1681 transitions. [2025-03-16 19:35:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:04,937 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-16 19:35:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:04,940 INFO L225 Difference]: With dead ends: 1158 [2025-03-16 19:35:04,940 INFO L226 Difference]: Without dead ends: 1032 [2025-03-16 19:35:04,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:04,941 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1044 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:04,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1063 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-16 19:35:04,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 650. [2025-03-16 19:35:04,948 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-16 19:35:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 930 transitions. [2025-03-16 19:35:04,951 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 930 transitions. Word has length 113 [2025-03-16 19:35:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:04,951 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 930 transitions. [2025-03-16 19:35:04,951 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-16 19:35:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 930 transitions. [2025-03-16 19:35:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:35:04,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:04,952 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-16 19:35:04,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-16 19:35:04,952 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:04,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:04,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1486267786, now seen corresponding path program 1 times [2025-03-16 19:35:04,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:04,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435360886] [2025-03-16 19:35:04,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:04,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:04,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:35:04,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:35:04,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:04,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435360886] [2025-03-16 19:35:05,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435360886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:05,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:05,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:05,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349394500] [2025-03-16 19:35:05,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:05,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:05,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:05,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:05,059 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-16 19:35:05,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:05,140 INFO L93 Difference]: Finished difference Result 1282 states and 1866 transitions. [2025-03-16 19:35:05,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:05,141 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-16 19:35:05,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:05,143 INFO L225 Difference]: With dead ends: 1282 [2025-03-16 19:35:05,143 INFO L226 Difference]: Without dead ends: 1156 [2025-03-16 19:35:05,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:05,146 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 974 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:05,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1163 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-03-16 19:35:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 774. [2025-03-16 19:35:05,153 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-16 19:35:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1115 transitions. [2025-03-16 19:35:05,154 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1115 transitions. Word has length 113 [2025-03-16 19:35:05,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:05,154 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1115 transitions. [2025-03-16 19:35:05,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:05,154 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1115 transitions. [2025-03-16 19:35:05,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:35:05,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:05,155 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:35:05,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-16 19:35:05,155 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:05,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:05,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1766302917, now seen corresponding path program 1 times [2025-03-16 19:35:05,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:05,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832253476] [2025-03-16 19:35:05,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:05,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:05,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:35:05,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:35:05,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:05,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:05,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:05,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832253476] [2025-03-16 19:35:05,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832253476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:05,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109395184] [2025-03-16 19:35:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:05,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:05,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:05,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:05,197 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-16 19:35:05,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:05,221 INFO L93 Difference]: Finished difference Result 2071 states and 3028 transitions. [2025-03-16 19:35:05,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:05,222 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-16 19:35:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:05,224 INFO L225 Difference]: With dead ends: 2071 [2025-03-16 19:35:05,224 INFO L226 Difference]: Without dead ends: 1387 [2025-03-16 19:35:05,224 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-16 19:35:05,225 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 111 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:05,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 306 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2025-03-16 19:35:05,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1374. [2025-03-16 19:35:05,235 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-16 19:35:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1969 transitions. [2025-03-16 19:35:05,236 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1969 transitions. Word has length 113 [2025-03-16 19:35:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:05,236 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 1969 transitions. [2025-03-16 19:35:05,236 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-16 19:35:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1969 transitions. [2025-03-16 19:35:05,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 19:35:05,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:05,237 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-16 19:35:05,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-16 19:35:05,237 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:05,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:05,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1802320236, now seen corresponding path program 1 times [2025-03-16 19:35:05,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:05,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558896393] [2025-03-16 19:35:05,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:05,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:05,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 19:35:05,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 19:35:05,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:05,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:05,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:05,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558896393] [2025-03-16 19:35:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558896393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:05,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:05,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:05,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634111449] [2025-03-16 19:35:05,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:05,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:05,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:05,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:05,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:05,381 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-16 19:35:05,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:05,460 INFO L93 Difference]: Finished difference Result 2660 states and 3843 transitions. [2025-03-16 19:35:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:05,460 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-16 19:35:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:05,462 INFO L225 Difference]: With dead ends: 2660 [2025-03-16 19:35:05,462 INFO L226 Difference]: Without dead ends: 1376 [2025-03-16 19:35:05,463 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-16 19:35:05,463 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 249 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:05,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 549 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2025-03-16 19:35:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1374. [2025-03-16 19:35:05,472 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-16 19:35:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1963 transitions. [2025-03-16 19:35:05,474 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1963 transitions. Word has length 113 [2025-03-16 19:35:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:05,474 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 1963 transitions. [2025-03-16 19:35:05,474 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-16 19:35:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1963 transitions. [2025-03-16 19:35:05,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-16 19:35:05,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:05,475 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-16 19:35:05,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-16 19:35:05,475 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:05,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:05,475 INFO L85 PathProgramCache]: Analyzing trace with hash 66936965, now seen corresponding path program 1 times [2025-03-16 19:35:05,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:05,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192509539] [2025-03-16 19:35:05,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:05,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:05,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-16 19:35:05,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-16 19:35:05,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:05,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:05,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:05,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192509539] [2025-03-16 19:35:05,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192509539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:05,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:05,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:05,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928010014] [2025-03-16 19:35:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:05,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:05,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:05,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:05,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:05,540 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-16 19:35:05,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:05,558 INFO L93 Difference]: Finished difference Result 3854 states and 5543 transitions. [2025-03-16 19:35:05,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:05,559 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-16 19:35:05,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:05,561 INFO L225 Difference]: With dead ends: 3854 [2025-03-16 19:35:05,561 INFO L226 Difference]: Without dead ends: 2570 [2025-03-16 19:35:05,562 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-16 19:35:05,563 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 89 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 406 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-16 19:35:05,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 406 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:05,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2025-03-16 19:35:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2480. [2025-03-16 19:35:05,581 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-16 19:35:05,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3543 transitions. [2025-03-16 19:35:05,583 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3543 transitions. Word has length 114 [2025-03-16 19:35:05,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:05,583 INFO L471 AbstractCegarLoop]: Abstraction has 2480 states and 3543 transitions. [2025-03-16 19:35:05,583 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-16 19:35:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3543 transitions. [2025-03-16 19:35:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 19:35:05,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:05,583 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-16 19:35:05,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-16 19:35:05,584 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:05,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash -635289718, now seen corresponding path program 1 times [2025-03-16 19:35:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:05,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129437687] [2025-03-16 19:35:05,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:05,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:05,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 19:35:05,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 19:35:05,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:05,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:05,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:05,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129437687] [2025-03-16 19:35:05,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129437687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:05,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:05,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:05,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947537410] [2025-03-16 19:35:05,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:05,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:05,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:05,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:05,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:05,646 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-16 19:35:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:05,665 INFO L93 Difference]: Finished difference Result 7084 states and 10129 transitions. [2025-03-16 19:35:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:05,665 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-16 19:35:05,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:05,671 INFO L225 Difference]: With dead ends: 7084 [2025-03-16 19:35:05,671 INFO L226 Difference]: Without dead ends: 4694 [2025-03-16 19:35:05,673 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-16 19:35:05,673 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 82 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 406 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-16 19:35:05,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 406 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:05,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4694 states. [2025-03-16 19:35:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4694 to 4516. [2025-03-16 19:35:05,733 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-16 19:35:05,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4516 states to 4516 states and 6417 transitions. [2025-03-16 19:35:05,737 INFO L78 Accepts]: Start accepts. Automaton has 4516 states and 6417 transitions. Word has length 115 [2025-03-16 19:35:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:05,737 INFO L471 AbstractCegarLoop]: Abstraction has 4516 states and 6417 transitions. [2025-03-16 19:35:05,737 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-16 19:35:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 4516 states and 6417 transitions. [2025-03-16 19:35:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-16 19:35:05,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:05,738 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-16 19:35:05,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-16 19:35:05,738 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:05,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:05,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1774286696, now seen corresponding path program 1 times [2025-03-16 19:35:05,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:05,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813857483] [2025-03-16 19:35:05,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:05,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:05,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-16 19:35:05,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-16 19:35:05,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:05,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:05,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813857483] [2025-03-16 19:35:05,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813857483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:05,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914266632] [2025-03-16 19:35:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:05,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:05,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:05,810 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-16 19:35:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:05,839 INFO L93 Difference]: Finished difference Result 13016 states and 18443 transitions. [2025-03-16 19:35:05,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:05,839 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-16 19:35:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:05,850 INFO L225 Difference]: With dead ends: 13016 [2025-03-16 19:35:05,850 INFO L226 Difference]: Without dead ends: 8590 [2025-03-16 19:35:05,854 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-16 19:35:05,854 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 75 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 406 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-16 19:35:05,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 406 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8590 states. [2025-03-16 19:35:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8590 to 8236. [2025-03-16 19:35:05,924 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-16 19:35:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8236 states to 8236 states and 11593 transitions. [2025-03-16 19:35:05,933 INFO L78 Accepts]: Start accepts. Automaton has 8236 states and 11593 transitions. Word has length 116 [2025-03-16 19:35:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:05,934 INFO L471 AbstractCegarLoop]: Abstraction has 8236 states and 11593 transitions. [2025-03-16 19:35:05,934 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-16 19:35:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 8236 states and 11593 transitions. [2025-03-16 19:35:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-16 19:35:05,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:05,934 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-16 19:35:05,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-16 19:35:05,935 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:05,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:05,935 INFO L85 PathProgramCache]: Analyzing trace with hash 925653565, now seen corresponding path program 1 times [2025-03-16 19:35:05,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:05,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606897567] [2025-03-16 19:35:05,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:05,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:05,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-16 19:35:05,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-16 19:35:05,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:05,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:06,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:06,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606897567] [2025-03-16 19:35:06,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606897567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:06,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:06,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:06,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84537620] [2025-03-16 19:35:06,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:06,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:06,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:06,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:06,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:06,006 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-16 19:35:06,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:06,081 INFO L93 Difference]: Finished difference Result 23824 states and 33355 transitions. [2025-03-16 19:35:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:06,082 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-16 19:35:06,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:06,108 INFO L225 Difference]: With dead ends: 23824 [2025-03-16 19:35:06,109 INFO L226 Difference]: Without dead ends: 15678 [2025-03-16 19:35:06,117 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-16 19:35:06,118 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 65 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 406 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-16 19:35:06,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 406 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:06,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15678 states. [2025-03-16 19:35:06,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15678 to 14972. [2025-03-16 19:35:06,288 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-16 19:35:06,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14972 states to 14972 states and 20801 transitions. [2025-03-16 19:35:06,307 INFO L78 Accepts]: Start accepts. Automaton has 14972 states and 20801 transitions. Word has length 117 [2025-03-16 19:35:06,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:06,307 INFO L471 AbstractCegarLoop]: Abstraction has 14972 states and 20801 transitions. [2025-03-16 19:35:06,307 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-16 19:35:06,308 INFO L276 IsEmpty]: Start isEmpty. Operand 14972 states and 20801 transitions. [2025-03-16 19:35:06,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:35:06,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:06,308 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-16 19:35:06,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-03-16 19:35:06,308 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:06,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 300558251, now seen corresponding path program 1 times [2025-03-16 19:35:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:06,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366651428] [2025-03-16 19:35:06,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:06,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:06,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:35:06,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:35:06,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:06,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366651428] [2025-03-16 19:35:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366651428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:35:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452040970] [2025-03-16 19:35:06,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:06,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:35:06,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:06,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:35:06,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:35:06,502 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-16 19:35:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:06,541 INFO L93 Difference]: Finished difference Result 15454 states and 21442 transitions. [2025-03-16 19:35:06,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:35:06,542 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-16 19:35:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:06,567 INFO L225 Difference]: With dead ends: 15454 [2025-03-16 19:35:06,567 INFO L226 Difference]: Without dead ends: 15452 [2025-03-16 19:35:06,573 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-16 19:35:06,573 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-16 19:35:06,573 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-16 19:35:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15452 states. [2025-03-16 19:35:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15452 to 15452. [2025-03-16 19:35:06,699 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-16 19:35:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15452 states to 15452 states and 21185 transitions. [2025-03-16 19:35:06,717 INFO L78 Accepts]: Start accepts. Automaton has 15452 states and 21185 transitions. Word has length 118 [2025-03-16 19:35:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:06,718 INFO L471 AbstractCegarLoop]: Abstraction has 15452 states and 21185 transitions. [2025-03-16 19:35:06,718 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-16 19:35:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 15452 states and 21185 transitions. [2025-03-16 19:35:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-16 19:35:06,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:06,719 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-16 19:35:06,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-16 19:35:06,719 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:06,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2027853018, now seen corresponding path program 1 times [2025-03-16 19:35:06,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:06,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433668602] [2025-03-16 19:35:06,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:06,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-16 19:35:06,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-16 19:35:06,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:06,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:06,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:06,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433668602] [2025-03-16 19:35:06,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433668602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:06,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:06,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:35:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919252898] [2025-03-16 19:35:06,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:06,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:35:06,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:06,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:35:06,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:35:06,813 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-16 19:35:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:06,990 INFO L93 Difference]: Finished difference Result 29464 states and 40551 transitions. [2025-03-16 19:35:06,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:35:06,990 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-16 19:35:06,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:07,028 INFO L225 Difference]: With dead ends: 29464 [2025-03-16 19:35:07,028 INFO L226 Difference]: Without dead ends: 26662 [2025-03-16 19:35:07,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:35:07,035 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 974 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:07,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1293 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:35:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26662 states. [2025-03-16 19:35:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26662 to 18252. [2025-03-16 19:35:07,225 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-16 19:35:07,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18252 states to 18252 states and 25025 transitions. [2025-03-16 19:35:07,247 INFO L78 Accepts]: Start accepts. Automaton has 18252 states and 25025 transitions. Word has length 118 [2025-03-16 19:35:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:07,247 INFO L471 AbstractCegarLoop]: Abstraction has 18252 states and 25025 transitions. [2025-03-16 19:35:07,248 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-16 19:35:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 18252 states and 25025 transitions. [2025-03-16 19:35:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-16 19:35:07,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:07,248 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-16 19:35:07,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-16 19:35:07,250 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:07,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:07,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1550000304, now seen corresponding path program 1 times [2025-03-16 19:35:07,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:07,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128396872] [2025-03-16 19:35:07,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:07,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:07,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-16 19:35:07,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-16 19:35:07,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:07,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:07,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:07,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128396872] [2025-03-16 19:35:07,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128396872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:07,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:07,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:07,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695205243] [2025-03-16 19:35:07,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:07,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:07,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:07,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:07,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:07,327 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-16 19:35:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:07,445 INFO L93 Difference]: Finished difference Result 47296 states and 64675 transitions. [2025-03-16 19:35:07,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:07,446 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-16 19:35:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:07,496 INFO L225 Difference]: With dead ends: 47296 [2025-03-16 19:35:07,496 INFO L226 Difference]: Without dead ends: 29134 [2025-03-16 19:35:07,513 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-16 19:35:07,513 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 93 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 409 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-16 19:35:07,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 409 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29134 states. [2025-03-16 19:35:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29134 to 27468. [2025-03-16 19:35:07,750 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-16 19:35:07,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27468 states to 27468 states and 37249 transitions. [2025-03-16 19:35:07,781 INFO L78 Accepts]: Start accepts. Automaton has 27468 states and 37249 transitions. Word has length 119 [2025-03-16 19:35:07,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:07,781 INFO L471 AbstractCegarLoop]: Abstraction has 27468 states and 37249 transitions. [2025-03-16 19:35:07,781 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-16 19:35:07,781 INFO L276 IsEmpty]: Start isEmpty. Operand 27468 states and 37249 transitions. [2025-03-16 19:35:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 19:35:07,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:07,784 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-16 19:35:07,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-16 19:35:07,785 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:07,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:07,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1492666054, now seen corresponding path program 1 times [2025-03-16 19:35:07,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:07,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294432378] [2025-03-16 19:35:07,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:07,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:07,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 19:35:07,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 19:35:07,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:07,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:07,924 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-16 19:35:07,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:07,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294432378] [2025-03-16 19:35:07,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294432378] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:35:07,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:35:07,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:35:07,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593308645] [2025-03-16 19:35:07,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:35:07,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:35:07,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:07,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:35:07,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:35:07,925 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-16 19:35:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:08,041 INFO L93 Difference]: Finished difference Result 54848 states and 74403 transitions. [2025-03-16 19:35:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:35:08,042 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-16 19:35:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:08,070 INFO L225 Difference]: With dead ends: 54848 [2025-03-16 19:35:08,070 INFO L226 Difference]: Without dead ends: 27470 [2025-03-16 19:35:08,093 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-16 19:35:08,094 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 82 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:08,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 379 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:35:08,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27470 states. [2025-03-16 19:35:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27470 to 27468. [2025-03-16 19:35:08,413 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-16 19:35:08,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27468 states to 27468 states and 36833 transitions. [2025-03-16 19:35:08,450 INFO L78 Accepts]: Start accepts. Automaton has 27468 states and 36833 transitions. Word has length 149 [2025-03-16 19:35:08,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:08,450 INFO L471 AbstractCegarLoop]: Abstraction has 27468 states and 36833 transitions. [2025-03-16 19:35:08,450 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-16 19:35:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 27468 states and 36833 transitions. [2025-03-16 19:35:08,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-16 19:35:08,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:08,453 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-16 19:35:08,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-03-16 19:35:08,453 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:08,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash 299715678, now seen corresponding path program 1 times [2025-03-16 19:35:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:08,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383939234] [2025-03-16 19:35:08,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:08,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:08,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 19:35:08,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 19:35:08,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:08,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383939234] [2025-03-16 19:35:08,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383939234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:35:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449616288] [2025-03-16 19:35:08,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:08,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:35:08,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:35:08,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:35:08,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:35:09,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-16 19:35:09,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-16 19:35:09,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:09,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:09,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-16 19:35:09,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:35:09,893 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-16 19:35:09,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:35:11,148 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-16 19:35:11,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449616288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:35:11,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:35:11,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 29 [2025-03-16 19:35:11,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143514924] [2025-03-16 19:35:11,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:35:11,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-16 19:35:11,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:11,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-16 19:35:11,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=0, NotChecked=0, Total=870 [2025-03-16 19:35:11,149 INFO L87 Difference]: Start difference. First operand 27468 states and 36833 transitions. Second operand has 30 states, 30 states have (on average 13.3) internal successors, (399), 29 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:17,971 INFO L93 Difference]: Finished difference Result 240323 states and 320880 transitions. [2025-03-16 19:35:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2025-03-16 19:35:17,972 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 13.3) internal successors, (399), 29 states have internal predecessors, (399), 0 states have call successors, (0), 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-16 19:35:17,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:18,205 INFO L225 Difference]: With dead ends: 240323 [2025-03-16 19:35:18,205 INFO L226 Difference]: Without dead ends: 212945 [2025-03-16 19:35:18,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10308 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4550, Invalid=26956, Unknown=0, NotChecked=0, Total=31506 [2025-03-16 19:35:18,255 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 3507 mSDsluCounter, 4552 mSDsCounter, 0 mSdLazyCounter, 5780 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3507 SdHoareTripleChecker+Valid, 4925 SdHoareTripleChecker+Invalid, 5837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:18,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3507 Valid, 4925 Invalid, 5837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 5780 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 19:35:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212945 states. [2025-03-16 19:35:20,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212945 to 137009. [2025-03-16 19:35:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137009 states, 137008 states have (on average 1.3306887189069252) internal successors, (182315), 137008 states have internal predecessors, (182315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137009 states to 137009 states and 182315 transitions. [2025-03-16 19:35:20,274 INFO L78 Accepts]: Start accepts. Automaton has 137009 states and 182315 transitions. Word has length 149 [2025-03-16 19:35:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:20,274 INFO L471 AbstractCegarLoop]: Abstraction has 137009 states and 182315 transitions. [2025-03-16 19:35:20,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 13.3) internal successors, (399), 29 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 137009 states and 182315 transitions. [2025-03-16 19:35:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-16 19:35:20,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:20,284 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-16 19:35:20,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:35:20,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:35:20,485 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:20,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1272780684, now seen corresponding path program 1 times [2025-03-16 19:35:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:20,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686922294] [2025-03-16 19:35:20,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:20,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:20,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:35:20,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:35:20,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:20,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:35:21,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:21,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686922294] [2025-03-16 19:35:21,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686922294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:35:21,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11771096] [2025-03-16 19:35:21,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:21,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:35:21,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:35:21,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:35:21,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:35:21,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-16 19:35:21,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-16 19:35:21,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:21,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:21,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:35:21,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:35:21,733 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-16 19:35:21,733 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:35:22,188 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-16 19:35:22,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11771096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:35:22,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:35:22,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 28 [2025-03-16 19:35:22,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289053416] [2025-03-16 19:35:22,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:35:22,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-16 19:35:22,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:22,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-16 19:35:22,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2025-03-16 19:35:22,190 INFO L87 Difference]: Start difference. First operand 137009 states and 182315 transitions. Second operand has 28 states, 28 states have (on average 14.321428571428571) internal successors, (401), 28 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:26,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:26,807 INFO L93 Difference]: Finished difference Result 600201 states and 798774 transitions. [2025-03-16 19:35:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-16 19:35:26,811 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 14.321428571428571) internal successors, (401), 28 states have internal predecessors, (401), 0 states have call successors, (0), 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-16 19:35:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:27,494 INFO L225 Difference]: With dead ends: 600201 [2025-03-16 19:35:27,495 INFO L226 Difference]: Without dead ends: 463363 [2025-03-16 19:35:27,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3064 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1604, Invalid=9316, Unknown=0, NotChecked=0, Total=10920 [2025-03-16 19:35:27,555 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 4050 mSDsluCounter, 4380 mSDsCounter, 0 mSdLazyCounter, 4360 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4050 SdHoareTripleChecker+Valid, 4693 SdHoareTripleChecker+Invalid, 4397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 4360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:27,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4050 Valid, 4693 Invalid, 4397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 4360 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:35:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463363 states. [2025-03-16 19:35:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463363 to 321553. [2025-03-16 19:35:31,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321553 states, 321552 states have (on average 1.328690227397124) internal successors, (427243), 321552 states have internal predecessors, (427243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:31,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321553 states to 321553 states and 427243 transitions. [2025-03-16 19:35:31,728 INFO L78 Accepts]: Start accepts. Automaton has 321553 states and 427243 transitions. Word has length 150 [2025-03-16 19:35:31,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:35:31,728 INFO L471 AbstractCegarLoop]: Abstraction has 321553 states and 427243 transitions. [2025-03-16 19:35:31,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.321428571428571) internal successors, (401), 28 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:35:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 321553 states and 427243 transitions. [2025-03-16 19:35:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 19:35:31,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:35:31,748 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-16 19:35:32,310 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,SelfDestructingSolverStorable62 [2025-03-16 19:35:32,310 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-03-16 19:35:32,310 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-16 19:35:32,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:35:32,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1362246433, now seen corresponding path program 1 times [2025-03-16 19:35:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:35:32,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486634448] [2025-03-16 19:35:32,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:32,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:35:32,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:35:32,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:35:32,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:32,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:32,542 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-16 19:35:32,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:35:32,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486634448] [2025-03-16 19:35:32,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486634448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:35:32,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814892639] [2025-03-16 19:35:32,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:35:32,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:35:32,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:35:32,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:35:32,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:35:32,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 19:35:32,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 19:35:32,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:35:32,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:35:32,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 19:35:32,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:35:33,499 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-16 19:35:33,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:35:33,958 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-16 19:35:33,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814892639] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:35:33,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:35:33,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2025-03-16 19:35:33,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802368324] [2025-03-16 19:35:33,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:35:33,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 19:35:33,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:35:33,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 19:35:33,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:35:33,959 INFO L87 Difference]: Start difference. First operand 321553 states and 427243 transitions. Second operand has 21 states, 21 states have (on average 18.238095238095237) internal successors, (383), 21 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)