./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:57:10,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:57:10,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:57:10,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:57:10,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:57:10,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:57:10,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:57:10,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:57:10,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:57:10,758 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:57:10,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:57:10,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:57:10,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:57:10,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:57:10,759 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:57:10,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:57:10,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:57:10,759 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:57:10,759 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:57:10,760 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:57:10,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:57:10,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:57:10,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:57:10,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:57:10,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:57:10,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:57:10,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:57:10,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:57:10,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:57:10,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:57:10,761 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:57:10,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:57:10,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:57:10,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:57:10,762 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:57:10,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:57:10,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:57:10,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:57:10,762 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8f0362e5bdd04ddb68671929eb7c82f3a55838c2357b753aa3b8d313416b3614 [2025-01-09 02:57:10,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:57:10,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:57:10,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:57:10,943 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:57:10,943 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:57:10,944 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2025-01-09 02:57:12,119 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2131fa57/bf0859f35f254adeba9c7d58d6324796/FLAG9fc0e1b34 [2025-01-09 02:57:12,363 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:57:12,368 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c [2025-01-09 02:57:12,376 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2131fa57/bf0859f35f254adeba9c7d58d6324796/FLAG9fc0e1b34 [2025-01-09 02:57:12,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c2131fa57/bf0859f35f254adeba9c7d58d6324796 [2025-01-09 02:57:12,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:57:12,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:57:12,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:57:12,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:57:12,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:57:12,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28de8d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12, skipping insertion in model container [2025-01-09 02:57:12,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:57:12,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2025-01-09 02:57:12,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2025-01-09 02:57:12,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2025-01-09 02:57:12,524 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2025-01-09 02:57:12,525 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2025-01-09 02:57:12,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2025-01-09 02:57:12,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2025-01-09 02:57:12,531 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2025-01-09 02:57:12,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2025-01-09 02:57:12,534 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2025-01-09 02:57:12,536 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2025-01-09 02:57:12,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2025-01-09 02:57:12,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2025-01-09 02:57:12,540 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2025-01-09 02:57:12,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2025-01-09 02:57:12,544 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2025-01-09 02:57:12,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:57:12,552 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:57:12,563 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1066,1079] [2025-01-09 02:57:12,564 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1266,1279] [2025-01-09 02:57:12,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1613,1626] [2025-01-09 02:57:12,567 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[1813,1826] [2025-01-09 02:57:12,570 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2024,2037] [2025-01-09 02:57:12,571 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2224,2237] [2025-01-09 02:57:12,572 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2629,2642] [2025-01-09 02:57:12,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[2829,2842] [2025-01-09 02:57:12,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3040,3053] [2025-01-09 02:57:12,574 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3243,3256] [2025-01-09 02:57:12,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3583,3596] [2025-01-09 02:57:12,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[3786,3799] [2025-01-09 02:57:12,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4000,4013] [2025-01-09 02:57:12,580 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4203,4216] [2025-01-09 02:57:12,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4547,4560] [2025-01-09 02:57:12,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i.v+cfa-reducer.c[4750,4763] [2025-01-09 02:57:12,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:57:12,599 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:57:12,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12 WrapperNode [2025-01-09 02:57:12,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:57:12,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:57:12,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:57:12,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:57:12,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,632 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2025-01-09 02:57:12,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:57:12,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:57:12,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:57:12,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:57:12,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,643 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,649 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 02:57:12,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,652 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,661 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:57:12,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:57:12,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:57:12,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:57:12,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (1/1) ... [2025-01-09 02:57:12,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:57:12,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:57:12,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:57:12,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:57:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:57:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:57:12,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:57:12,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:57:12,773 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:57:12,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:57:12,955 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-01-09 02:57:12,955 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:57:12,963 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:57:12,963 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:57:12,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:57:12 BoogieIcfgContainer [2025-01-09 02:57:12,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:57:12,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:57:12,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:57:12,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:57:12,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:57:12" (1/3) ... [2025-01-09 02:57:12,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b845bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:57:12, skipping insertion in model container [2025-01-09 02:57:12,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:57:12" (2/3) ... [2025-01-09 02:57:12,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b845bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:57:12, skipping insertion in model container [2025-01-09 02:57:12,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:57:12" (3/3) ... [2025-01-09 02:57:12,970 INFO L128 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i.v+cfa-reducer.c [2025-01-09 02:57:12,979 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:57:12,980 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG SpamAssassin-loop.i.v+cfa-reducer.c that has 1 procedures, 60 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-01-09 02:57:13,021 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:57:13,030 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;@564ff71d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:57:13,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-01-09 02:57:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 59 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-01-09 02:57:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 02:57:13,044 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:13,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:13,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:13,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1241029004, now seen corresponding path program 1 times [2025-01-09 02:57:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:13,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180174369] [2025-01-09 02:57:13,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:13,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 02:57:13,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 02:57:13,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:13,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:13,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180174369] [2025-01-09 02:57:13,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180174369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:13,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:13,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:57:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455832666] [2025-01-09 02:57:13,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:13,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:57:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:13,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:57:13,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:57:13,306 INFO L87 Difference]: Start difference. First operand has 60 states, 43 states have (on average 1.8837209302325582) internal successors, (81), 59 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) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:13,321 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2025-01-09 02:57:13,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:57:13,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 02:57:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:13,326 INFO L225 Difference]: With dead ends: 63 [2025-01-09 02:57:13,326 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 02:57:13,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:57:13,330 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:13,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 02:57:13,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 02:57:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.475) internal successors, (59), 54 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-01-09 02:57:13,350 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2025-01-09 02:57:13,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:13,350 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-01-09 02:57:13,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,350 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-01-09 02:57:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 02:57:13,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:13,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:13,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:57:13,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:13,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:13,352 INFO L85 PathProgramCache]: Analyzing trace with hash -182802478, now seen corresponding path program 1 times [2025-01-09 02:57:13,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:13,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118959606] [2025-01-09 02:57:13,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:13,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 02:57:13,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 02:57:13,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:13,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:13,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118959606] [2025-01-09 02:57:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118959606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:13,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:13,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:57:13,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89125403] [2025-01-09 02:57:13,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:13,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:57:13,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:13,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:57:13,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:13,430 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:13,485 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2025-01-09 02:57:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:13,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 02:57:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:13,485 INFO L225 Difference]: With dead ends: 55 [2025-01-09 02:57:13,485 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 02:57:13,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:13,486 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 47 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:13,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 84 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 02:57:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 02:57:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2025-01-09 02:57:13,492 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 10 [2025-01-09 02:57:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:13,492 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2025-01-09 02:57:13,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2025-01-09 02:57:13,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 02:57:13,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:13,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:13,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:57:13,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:13,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash -179156060, now seen corresponding path program 1 times [2025-01-09 02:57:13,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:13,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527042328] [2025-01-09 02:57:13,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:13,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:13,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 02:57:13,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 02:57:13,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:13,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527042328] [2025-01-09 02:57:13,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527042328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:13,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:13,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:57:13,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370275004] [2025-01-09 02:57:13,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:13,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:57:13,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:13,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:57:13,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:13,569 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:13,600 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2025-01-09 02:57:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:13,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-01-09 02:57:13,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:13,601 INFO L225 Difference]: With dead ends: 103 [2025-01-09 02:57:13,601 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 02:57:13,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:13,602 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:13,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 106 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 02:57:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-01-09 02:57:13,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.435897435897436) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2025-01-09 02:57:13,605 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 10 [2025-01-09 02:57:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:13,605 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2025-01-09 02:57:13,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,605 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2025-01-09 02:57:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-01-09 02:57:13,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:13,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:13,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:57:13,606 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-01-09 02:57:13,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:13,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1258866483, now seen corresponding path program 1 times [2025-01-09 02:57:13,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:13,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897909120] [2025-01-09 02:57:13,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:13,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:13,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-09 02:57:13,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-09 02:57:13,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:13,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:13,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:13,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897909120] [2025-01-09 02:57:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897909120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:13,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:57:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868794363] [2025-01-09 02:57:13,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:13,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:57:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:13,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:57:13,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:13,670 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:13,701 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2025-01-09 02:57:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:13,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-01-09 02:57:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:13,702 INFO L225 Difference]: With dead ends: 52 [2025-01-09 02:57:13,702 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 02:57:13,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:13,702 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 42 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:13,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 76 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 02:57:13,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-01-09 02:57:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-01-09 02:57:13,705 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 11 [2025-01-09 02:57:13,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:13,705 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-01-09 02:57:13,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,706 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-01-09 02:57:13,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 02:57:13,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:13,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:13,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:57:13,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:13,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:13,707 INFO L85 PathProgramCache]: Analyzing trace with hash 420636790, now seen corresponding path program 1 times [2025-01-09 02:57:13,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:13,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788193810] [2025-01-09 02:57:13,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:13,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:13,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 02:57:13,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:57:13,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:13,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:13,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:13,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788193810] [2025-01-09 02:57:13,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788193810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:13,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:13,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:57:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670630556] [2025-01-09 02:57:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:13,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:57:13,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:13,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:57:13,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:13,752 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:13,779 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2025-01-09 02:57:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 02:57:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:13,780 INFO L225 Difference]: With dead ends: 51 [2025-01-09 02:57:13,780 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 02:57:13,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:13,780 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 21 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:13,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 98 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:13,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 02:57:13,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-01-09 02:57:13,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-01-09 02:57:13,783 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 12 [2025-01-09 02:57:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:13,783 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-01-09 02:57:13,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,783 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-01-09 02:57:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 02:57:13,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:13,784 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:13,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 02:57:13,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:13,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash -370151221, now seen corresponding path program 1 times [2025-01-09 02:57:13,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:13,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599362325] [2025-01-09 02:57:13,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:13,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:13,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 02:57:13,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 02:57:13,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:13,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:13,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:13,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599362325] [2025-01-09 02:57:13,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599362325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:13,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:13,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:57:13,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863386822] [2025-01-09 02:57:13,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:13,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:57:13,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:13,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:57:13,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:13,834 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:13,871 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2025-01-09 02:57:13,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:57:13,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-01-09 02:57:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:13,872 INFO L225 Difference]: With dead ends: 48 [2025-01-09 02:57:13,872 INFO L226 Difference]: Without dead ends: 46 [2025-01-09 02:57:13,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 02:57:13,873 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 62 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:13,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 94 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-01-09 02:57:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-01-09 02:57:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 45 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-01-09 02:57:13,875 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 12 [2025-01-09 02:57:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:13,875 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-01-09 02:57:13,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-01-09 02:57:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 02:57:13,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:13,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:13,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 02:57:13,876 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:13,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:13,876 INFO L85 PathProgramCache]: Analyzing trace with hash 154842714, now seen corresponding path program 1 times [2025-01-09 02:57:13,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:13,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427899637] [2025-01-09 02:57:13,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:13,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:13,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 02:57:13,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 02:57:13,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:13,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:13,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:13,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427899637] [2025-01-09 02:57:13,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427899637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:13,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:13,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:57:13,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856801716] [2025-01-09 02:57:13,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:13,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:57:13,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:13,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:57:13,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:13,933 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:13,974 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2025-01-09 02:57:13,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:57:13,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 02:57:13,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:13,975 INFO L225 Difference]: With dead ends: 46 [2025-01-09 02:57:13,975 INFO L226 Difference]: Without dead ends: 44 [2025-01-09 02:57:13,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:13,976 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:13,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 91 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-09 02:57:13,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-09 02:57:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-01-09 02:57:13,978 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 13 [2025-01-09 02:57:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:13,978 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-01-09 02:57:13,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-01-09 02:57:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 02:57:13,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:13,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:13,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 02:57:13,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:13,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1410218132, now seen corresponding path program 1 times [2025-01-09 02:57:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:13,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427423153] [2025-01-09 02:57:13,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:13,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 02:57:13,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 02:57:13,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:13,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:14,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427423153] [2025-01-09 02:57:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427423153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:14,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:14,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:57:14,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582779060] [2025-01-09 02:57:14,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:14,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:57:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:14,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:57:14,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:14,026 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:14,051 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-01-09 02:57:14,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:14,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-01-09 02:57:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:14,053 INFO L225 Difference]: With dead ends: 45 [2025-01-09 02:57:14,053 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 02:57:14,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:14,054 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:14,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 67 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 02:57:14,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-01-09 02:57:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-01-09 02:57:14,056 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2025-01-09 02:57:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:14,056 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-01-09 02:57:14,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-01-09 02:57:14,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 02:57:14,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:14,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:14,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 02:57:14,059 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:14,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash 505160957, now seen corresponding path program 1 times [2025-01-09 02:57:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:14,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999283056] [2025-01-09 02:57:14,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:14,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 02:57:14,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 02:57:14,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:14,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:14,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-01-09 02:57:14,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:14,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999283056] [2025-01-09 02:57:14,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999283056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:14,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:14,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:57:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97227311] [2025-01-09 02:57:14,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:14,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:57:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:14,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:57:14,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:14,145 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:14,189 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2025-01-09 02:57:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:57:14,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 02:57:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:14,189 INFO L225 Difference]: With dead ends: 42 [2025-01-09 02:57:14,189 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 02:57:14,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-01-09 02:57:14,190 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 48 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:14,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 82 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 02:57:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 02:57:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-01-09 02:57:14,192 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 14 [2025-01-09 02:57:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:14,192 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-01-09 02:57:14,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-01-09 02:57:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 02:57:14,192 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:14,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:14,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 02:57:14,195 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:14,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:14,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1519875391, now seen corresponding path program 1 times [2025-01-09 02:57:14,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:14,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982100628] [2025-01-09 02:57:14,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:14,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:14,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 02:57:14,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 02:57:14,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:14,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:14,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:14,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982100628] [2025-01-09 02:57:14,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982100628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:14,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:14,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:57:14,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080116498] [2025-01-09 02:57:14,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:14,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:57:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:14,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:57:14,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:14,260 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:14,285 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2025-01-09 02:57:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:14,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 02:57:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:14,286 INFO L225 Difference]: With dead ends: 41 [2025-01-09 02:57:14,286 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 02:57:14,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:14,287 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:14,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 02:57:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-01-09 02:57:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.3125) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-01-09 02:57:14,291 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 15 [2025-01-09 02:57:14,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:14,291 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-01-09 02:57:14,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,291 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-01-09 02:57:14,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 02:57:14,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:14,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:14,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 02:57:14,292 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:14,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:14,292 INFO L85 PathProgramCache]: Analyzing trace with hash 128507268, now seen corresponding path program 1 times [2025-01-09 02:57:14,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:14,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701608785] [2025-01-09 02:57:14,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:14,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:14,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 02:57:14,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 02:57:14,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:14,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:14,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:14,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701608785] [2025-01-09 02:57:14,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701608785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:14,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:14,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 02:57:14,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418414041] [2025-01-09 02:57:14,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:14,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 02:57:14,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:14,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 02:57:14,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:14,347 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:14,368 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2025-01-09 02:57:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 02:57:14,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-01-09 02:57:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:14,369 INFO L225 Difference]: With dead ends: 43 [2025-01-09 02:57:14,369 INFO L226 Difference]: Without dead ends: 41 [2025-01-09 02:57:14,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 02:57:14,370 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:14,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 90 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-01-09 02:57:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2025-01-09 02:57:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 35 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2025-01-09 02:57:14,372 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2025-01-09 02:57:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:14,372 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2025-01-09 02:57:14,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,372 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2025-01-09 02:57:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 02:57:14,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:14,372 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:14,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 02:57:14,372 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:14,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash -311237848, now seen corresponding path program 1 times [2025-01-09 02:57:14,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:14,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538167670] [2025-01-09 02:57:14,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:14,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 02:57:14,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 02:57:14,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:14,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:14,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:14,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538167670] [2025-01-09 02:57:14,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538167670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:14,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:14,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:57:14,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585693885] [2025-01-09 02:57:14,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:14,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:57:14,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:14,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:57:14,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:14,434 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:14,483 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2025-01-09 02:57:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:57:14,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 02:57:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:14,484 INFO L225 Difference]: With dead ends: 52 [2025-01-09 02:57:14,484 INFO L226 Difference]: Without dead ends: 50 [2025-01-09 02:57:14,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:14,484 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 38 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:14,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 88 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-01-09 02:57:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2025-01-09 02:57:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 33 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-01-09 02:57:14,486 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 17 [2025-01-09 02:57:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:14,486 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-01-09 02:57:14,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-01-09 02:57:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 02:57:14,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:14,487 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:14,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 02:57:14,487 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:14,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1058434549, now seen corresponding path program 1 times [2025-01-09 02:57:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:14,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137277321] [2025-01-09 02:57:14,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:14,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 02:57:14,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 02:57:14,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:14,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:14,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:14,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137277321] [2025-01-09 02:57:14,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137277321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:14,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:14,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:57:14,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765247022] [2025-01-09 02:57:14,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:14,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:57:14,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:14,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:57:14,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:14,551 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:14,596 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-01-09 02:57:14,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:57:14,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-01-09 02:57:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:14,597 INFO L225 Difference]: With dead ends: 37 [2025-01-09 02:57:14,597 INFO L226 Difference]: Without dead ends: 35 [2025-01-09 02:57:14,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:57:14,598 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 43 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:14,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 70 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-09 02:57:14,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-01-09 02:57:14,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-01-09 02:57:14,599 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2025-01-09 02:57:14,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:14,600 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-01-09 02:57:14,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-01-09 02:57:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 02:57:14,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:14,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:14,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 02:57:14,600 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:14,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:14,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1548271503, now seen corresponding path program 1 times [2025-01-09 02:57:14,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:14,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251232548] [2025-01-09 02:57:14,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:14,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:14,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:57:14,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:57:14,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:14,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:14,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-01-09 02:57:14,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:14,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251232548] [2025-01-09 02:57:14,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251232548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:14,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:14,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:57:14,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871377264] [2025-01-09 02:57:14,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:14,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:57:14,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:14,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:57:14,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:57:14,649 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:14,691 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-01-09 02:57:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 02:57:14,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 02:57:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:14,691 INFO L225 Difference]: With dead ends: 47 [2025-01-09 02:57:14,691 INFO L226 Difference]: Without dead ends: 45 [2025-01-09 02:57:14,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:14,692 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 28 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:14,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 91 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-09 02:57:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2025-01-09 02:57:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-01-09 02:57:14,694 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2025-01-09 02:57:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:14,694 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-01-09 02:57:14,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-01-09 02:57:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 02:57:14,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:14,694 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] [2025-01-09 02:57:14,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 02:57:14,694 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:14,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:14,695 INFO L85 PathProgramCache]: Analyzing trace with hash 751780498, now seen corresponding path program 1 times [2025-01-09 02:57:14,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:14,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542393759] [2025-01-09 02:57:14,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:14,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:14,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 02:57:14,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 02:57:14,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:14,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:14,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:14,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:14,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542393759] [2025-01-09 02:57:14,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542393759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:14,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:57:14,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462267004] [2025-01-09 02:57:14,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:14,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:57:14,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:14,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:57:14,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:14,751 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:14,791 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-01-09 02:57:14,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:57:14,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 02:57:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:14,791 INFO L225 Difference]: With dead ends: 33 [2025-01-09 02:57:14,791 INFO L226 Difference]: Without dead ends: 31 [2025-01-09 02:57:14,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:57:14,792 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 41 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:14,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 50 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:57:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-09 02:57:14,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-01-09 02:57:14,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-01-09 02:57:14,793 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2025-01-09 02:57:14,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:14,794 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-01-09 02:57:14,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-01-09 02:57:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 02:57:14,794 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:57:14,794 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] [2025-01-09 02:57:14,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 02:57:14,794 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-01-09 02:57:14,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:57:14,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1830363126, now seen corresponding path program 1 times [2025-01-09 02:57:14,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:57:14,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304936755] [2025-01-09 02:57:14,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:57:14,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:57:14,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 02:57:14,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:57:14,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:57:14,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:57:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:57:14,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:57:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304936755] [2025-01-09 02:57:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304936755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:57:14,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:57:14,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:57:14,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145210231] [2025-01-09 02:57:14,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:57:14,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:57:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:57:14,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:57:14,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:57:14,859 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:57:14,946 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2025-01-09 02:57:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:57:14,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-01-09 02:57:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:57:14,947 INFO L225 Difference]: With dead ends: 63 [2025-01-09 02:57:14,947 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 02:57:14,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:57:14,948 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 43 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:57:14,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 129 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:57:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 02:57:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 02:57:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 02:57:14,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2025-01-09 02:57:14,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:57:14,949 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 02:57:14,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:57:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 02:57:14,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 02:57:14,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-01-09 02:57:14,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-01-09 02:57:14,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-01-09 02:57:14,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-01-09 02:57:14,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-01-09 02:57:14,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-01-09 02:57:14,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-01-09 02:57:14,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-01-09 02:57:14,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-01-09 02:57:14,951 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-01-09 02:57:14,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-01-09 02:57:14,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-01-09 02:57:14,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-01-09 02:57:14,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-01-09 02:57:14,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-01-09 02:57:14,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-01-09 02:57:14,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 02:57:14,953 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:57:14,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 02:57:14,958 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:57:14,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:57:14 BoogieIcfgContainer [2025-01-09 02:57:14,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:57:14,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:57:14,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:57:14,962 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:57:14,962 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:57:12" (3/4) ... [2025-01-09 02:57:14,963 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 02:57:14,969 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-09 02:57:14,970 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 02:57:14,970 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 02:57:14,970 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 02:57:15,021 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:57:15,021 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:57:15,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:57:15,022 INFO L158 Benchmark]: Toolchain (without parser) took 2632.50ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 98.9MB in the end (delta: 6.1MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2025-01-09 02:57:15,022 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:57:15,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.39ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 92.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:57:15,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.09ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:57:15,023 INFO L158 Benchmark]: Boogie Preprocessor took 26.23ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 88.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:57:15,023 INFO L158 Benchmark]: RCFGBuilder took 301.59ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 73.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:57:15,023 INFO L158 Benchmark]: TraceAbstraction took 1995.99ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 105.9MB in the end (delta: -33.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:57:15,023 INFO L158 Benchmark]: Witness Printer took 60.08ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 98.9MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:57:15,025 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.39ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 92.0MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.09ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.23ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 88.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 301.59ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 73.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1995.99ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 105.9MB in the end (delta: -33.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 60.08ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 98.9MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 47]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 59]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 76]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 100]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 112]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 141]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 153]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 165]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 177]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 193]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 205]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 217]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 229]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 245]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 257]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 60 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 1396 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 819 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 677 IncrementalHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 577 mSDtfsCounter, 677 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 46 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 694 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 02:57:15,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE