./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-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 36155c026d6f06befb990fb5a3d65a68afe6fa3a7c90cfb309e05b30e27a8889 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:24:33,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:24:33,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:24:33,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:24:33,740 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:24:33,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:24:33,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:24:33,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:24:33,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:24:33,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:24:33,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:24:33,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:24:33,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:24:33,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:24:33,756 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:24:33,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:24:33,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:24:33,756 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:24:33,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:24:33,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:24:33,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:24:33,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:24:33,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:24:33,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:24:33,757 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:24:33,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:24:33,757 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:24:33,757 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:24:33,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:24:33,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:24:33,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:24:33,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:24:33,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:24:33,759 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 -> 36155c026d6f06befb990fb5a3d65a68afe6fa3a7c90cfb309e05b30e27a8889 [2025-02-07 21:24:34,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:24:34,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:24:34,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:24:34,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:24:34,019 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:24:34,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-07 21:24:35,241 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b119efc22/e9b594978cfa47fe98d384bf4b9c7b6e/FLAG04ab9ff35 [2025-02-07 21:24:35,630 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:24:35,630 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-07 21:24:35,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b119efc22/e9b594978cfa47fe98d384bf4b9c7b6e/FLAG04ab9ff35 [2025-02-07 21:24:35,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b119efc22/e9b594978cfa47fe98d384bf4b9c7b6e [2025-02-07 21:24:35,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:24:35,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:24:35,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:24:35,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:24:35,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:24:35,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:24:35" (1/1) ... [2025-02-07 21:24:35,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744be3a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:35, skipping insertion in model container [2025-02-07 21:24:35,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:24:35" (1/1) ... [2025-02-07 21:24:35,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:24:36,339 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34950,34963] [2025-02-07 21:24:36,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[35840,35853] [2025-02-07 21:24:36,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37627,37640] [2025-02-07 21:24:36,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[38517,38530] [2025-02-07 21:24:36,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[41204,41217] [2025-02-07 21:24:36,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[42097,42110] [2025-02-07 21:24:36,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[43887,43900] [2025-02-07 21:24:36,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[45248,45261] [2025-02-07 21:24:36,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/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[60716,60729] [2025-02-07 21:24:36,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/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[61609,61622] [2025-02-07 21:24:36,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/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[63399,63412] [2025-02-07 21:24:36,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[67812,67825] [2025-02-07 21:24:36,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:24:36,655 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:24:36,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[34950,34963] [2025-02-07 21:24:36,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[35840,35853] [2025-02-07 21:24:36,880 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[37627,37640] [2025-02-07 21:24:36,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[38517,38530] [2025-02-07 21:24:36,904 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[41204,41217] [2025-02-07 21:24:36,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[42097,42110] [2025-02-07 21:24:36,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[43887,43900] [2025-02-07 21:24:36,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[45248,45261] [2025-02-07 21:24:37,000 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[60716,60729] [2025-02-07 21:24:37,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[61609,61622] [2025-02-07 21:24:37,020 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[63399,63412] [2025-02-07 21:24:37,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[67812,67825] [2025-02-07 21:24:37,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:24:37,130 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:24:37,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37 WrapperNode [2025-02-07 21:24:37,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:24:37,132 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:24:37,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:24:37,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:24:37,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,281 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4310 [2025-02-07 21:24:37,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:24:37,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:24:37,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:24:37,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:24:37,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,304 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,352 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-02-07 21:24:37,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,379 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:24:37,408 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:24:37,408 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:24:37,408 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:24:37,409 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (1/1) ... [2025-02-07 21:24:37,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:24:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:24:37,438 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-02-07 21:24:37,442 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-02-07 21:24:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:24:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:24:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:24:37,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:24:37,585 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:24:37,587 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:24:39,785 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3934: havoc main_~node2__newmax~7#1; [2025-02-07 21:24:39,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4331: havoc main_~check__tmp~17#1; [2025-02-07 21:24:39,786 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2485: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4210: havoc main_~node4__newmax~11#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2370: havoc main_~node3__newmax~6#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4089: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5015: havoc main_~check__tmp~21#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3166: havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2904: havoc main_~node4__newmax~9#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4888: havoc main_~check__tmp~20#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778: havoc main_~node1__newmax~6#1;havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1856: havoc main_~node2__newmax~5#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4633: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~18#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3974: havoc main_~node3__newmax~8#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2264: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-07 21:24:39,787 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2132: havoc main_~node4__newmax~6#1; [2025-02-07 21:24:39,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3326: havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-07 21:24:39,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4518: havoc main_~node3__newmax~9#1; [2025-02-07 21:24:39,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:24:39,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2011: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-07 21:24:39,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-02-07 21:24:39,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410: havoc main_~node4__newmax~7#1; [2025-02-07 21:24:39,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2681: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-02-07 21:24:39,788 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2820: havoc main_~node2__newmax~6#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: havoc main_~node3__newmax~5#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4146: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4014: havoc main_~node4__newmax~10#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3486: havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4679: havoc main_~check__tmp~19#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4285: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: havoc main_~check__tmp~13#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4558: havoc main_~node4__newmax~12#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4824: havoc main_~node4__newmax~13#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3646: havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2068: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1936: havoc main_~node4__newmax~5#1; [2025-02-07 21:24:39,789 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2862: havoc main_~node3__newmax~7#1; [2025-02-07 21:24:39,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2207: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-07 21:24:39,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2606: havoc main_~node4__newmax~8#1; [2025-02-07 21:24:39,790 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1816: havoc main_~node1__newmax~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__newmax~4#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__newmax~4#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__newmax~4#1;havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~node1__newmax~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node4__newmax~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1;havoc main_~node1__newmax~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__newmax~2#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__newmax~2#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__newmax~2#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__newmax~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node4__newmax~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__newmax~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1;#t~ret48#1 := main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~node4__newmax~5#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~node4__newmax~6#1, main_~node3__newmax~5#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~9#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~10#1, main_~node4__newmax~7#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~11#1, main_~check__tmp~13#1, main_~node4____CPAchecker_TMP_2~3#1, main_~node4____CPAchecker_TMP_1~3#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__newmax~9#1, main_~node3____CPAchecker_TMP_2~3#1, main_~node3____CPAchecker_TMP_1~3#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__newmax~7#1, main_~node2____CPAchecker_TMP_2~3#1, main_~node2____CPAchecker_TMP_1~3#1, main_~node2____CPAchecker_TMP_0~3#1, main_~node2__newmax~6#1, main_~node1____CPAchecker_TMP_2~3#1, main_~node1____CPAchecker_TMP_1~3#1, main_~node1____CPAchecker_TMP_0~3#1, main_~node1__newmax~6#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~12#1, main_~node4__newmax~8#1, main_~node3__newmax~6#1, main_~node2__newmax~5#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~14#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~15#1, main_~node4__newmax~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~16#1, main_~check__tmp~17#1, main_~node4__newmax~11#1, main_~node3__newmax~8#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~18#1, main_~check__tmp~19#1, main_~node4__newmax~12#1, main_~check__tmp~20#1, main_~check__tmp~21#1, main_~node4__newmax~13#1, main_~node3__newmax~9#1, main_~node2__newmax~7#1, main_~node1__newmax~5#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~node4____CPAchecker_TMP_2~2#1, main_~node4____CPAchecker_TMP_1~2#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__newmax~4#1, main_~node3____CPAchecker_TMP_2~2#1, main_~node3____CPAchecker_TMP_1~2#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__newmax~4#1, main_~node2____CPAchecker_TMP_2~2#1, main_~node2____CPAchecker_TMP_1~2#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__newmax~4#1, main_~node1____CPAchecker_TMP_2~2#1, main_~node1____CPAchecker_TMP_1~2#1, main_~node1____CPAchecker_TMP_0~2#1, main_~node1__newmax~4#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__newmax~3#1, main_~node3__newmax~3#1, main_~node2__newmax~3#1, main_~node1__newmax~3#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_2~1#1, main_~node4____CPAchecker_TMP_1~1#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__newmax~2#1, main_~node3____CPAchecker_TMP_2~1#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__newmax~2#1, main_~node2____CPAchecker_TMP_2~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__newmax~2#1, main_~node1____CPAchecker_TMP_2~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__newmax~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~node4__newmax~1#1, main_~node3__newmax~1#1, main_~node2__newmax~1#1, main_~node1__newmax~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node4____CPAchecker_TMP_2~0#1, main_~node4____CPAchecker_TMP_1~0#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__newmax~0#1, main_~node3____CPAchecker_TMP_2~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__newmax~0#1, main_~node2____CPAchecker_TMP_2~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__newmax~0#1, main_~node1____CPAchecker_TMP_2~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__newmax~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1, main_~main__c1~0#1, main_~main__i2~0#1;assume { :end_inline_main } true; [2025-02-07 21:24:39,996 INFO L? ?]: Removed 872 outVars from TransFormulas that were not future-live. [2025-02-07 21:24:39,996 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:24:40,025 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:24:40,028 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:24:40,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:24:40 BoogieIcfgContainer [2025-02-07 21:24:40,029 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:24:40,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:24:40,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:24:40,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:24:40,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:24:35" (1/3) ... [2025-02-07 21:24:40,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbc8bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:24:40, skipping insertion in model container [2025-02-07 21:24:40,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:37" (2/3) ... [2025-02-07 21:24:40,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bbc8bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:24:40, skipping insertion in model container [2025-02-07 21:24:40,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:24:40" (3/3) ... [2025-02-07 21:24:40,038 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-07 21:24:40,048 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:24:40,053 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 1138 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-02-07 21:24:40,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:24:40,115 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;@4101bc5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:24:40,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-07 21:24:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 1137 states, 794 states have (on average 1.9987405541561714) internal successors, (1587), 1136 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:24:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-07 21:24:40,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:40,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:24:40,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:24:40,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:40,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2062556620, now seen corresponding path program 1 times [2025-02-07 21:24:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:40,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997123649] [2025-02-07 21:24:40,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:40,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-07 21:24:40,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-07 21:24:40,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:40,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:48,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:24:48,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:48,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997123649] [2025-02-07 21:24:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997123649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:48,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:48,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:24:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241023095] [2025-02-07 21:24:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:48,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 21:24:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:48,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 21:24:48,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:24:48,959 INFO L87 Difference]: Start difference. First operand has 1137 states, 794 states have (on average 1.9987405541561714) internal successors, (1587), 1136 states have internal predecessors, (1587), 0 states have call successors, (0), 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 27 states, 27 states have (on average 15.148148148148149) internal successors, (409), 27 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:24:50,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:50,988 INFO L93 Difference]: Finished difference Result 1173 states and 1587 transitions. [2025-02-07 21:24:50,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-07 21:24:50,990 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 15.148148148148149) internal successors, (409), 27 states have internal predecessors, (409), 0 states have call successors, (0), 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 409 [2025-02-07 21:24:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:51,000 INFO L225 Difference]: With dead ends: 1173 [2025-02-07 21:24:51,001 INFO L226 Difference]: Without dead ends: 519 [2025-02-07 21:24:51,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1129, Invalid=2903, Unknown=0, NotChecked=0, Total=4032 [2025-02-07 21:24:51,010 INFO L435 NwaCegarLoop]: 1279 mSDtfsCounter, 5259 mSDsluCounter, 10344 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5259 SdHoareTripleChecker+Valid, 11623 SdHoareTripleChecker+Invalid, 1858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:51,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5259 Valid, 11623 Invalid, 1858 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [246 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-07 21:24:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-07 21:24:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2025-02-07 21:24:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 511 states have (on average 1.0136986301369864) internal successors, (518), 518 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:24:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 518 transitions. [2025-02-07 21:24:51,065 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 518 transitions. Word has length 409 [2025-02-07 21:24:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:51,067 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 518 transitions. [2025-02-07 21:24:51,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.148148148148149) internal successors, (409), 27 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:24:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 518 transitions. [2025-02-07 21:24:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-07 21:24:51,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:51,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:24:51,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:24:51,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:24:51,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:51,073 INFO L85 PathProgramCache]: Analyzing trace with hash -801229246, now seen corresponding path program 1 times [2025-02-07 21:24:51,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:51,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932251176] [2025-02-07 21:24:51,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:51,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:51,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-07 21:24:51,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-07 21:24:51,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:51,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:24:57,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:57,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932251176] [2025-02-07 21:24:57,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932251176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:57,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:57,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-07 21:24:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192432112] [2025-02-07 21:24:57,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:57,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 21:24:57,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:57,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 21:24:57,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-02-07 21:24:57,261 INFO L87 Difference]: Start difference. First operand 519 states and 518 transitions. Second operand has 28 states, 28 states have (on average 14.607142857142858) internal successors, (409), 28 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:24:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:58,404 INFO L93 Difference]: Finished difference Result 519 states and 518 transitions. [2025-02-07 21:24:58,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 21:24:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 14.607142857142858) internal successors, (409), 28 states have internal predecessors, (409), 0 states have call successors, (0), 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 409 [2025-02-07 21:24:58,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:58,407 INFO L225 Difference]: With dead ends: 519 [2025-02-07 21:24:58,407 INFO L226 Difference]: Without dead ends: 493 [2025-02-07 21:24:58,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=959, Invalid=2581, Unknown=0, NotChecked=0, Total=3540 [2025-02-07 21:24:58,409 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 1304 mSDsluCounter, 4000 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 4422 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:58,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 4422 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 21:24:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-07 21:24:58,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-02-07 21:24:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 487 states have (on average 1.0102669404517455) internal successors, (492), 492 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:24:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 492 transitions. [2025-02-07 21:24:58,418 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 492 transitions. Word has length 409 [2025-02-07 21:24:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:58,419 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 492 transitions. [2025-02-07 21:24:58,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.607142857142858) internal successors, (409), 28 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:24:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 492 transitions. [2025-02-07 21:24:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-07 21:24:58,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:58,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:24:58,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:24:58,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:24:58,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:58,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1437001830, now seen corresponding path program 1 times [2025-02-07 21:24:58,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:58,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110689270] [2025-02-07 21:24:58,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:58,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-07 21:24:58,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-07 21:24:58,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:58,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:25:04,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:04,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110689270] [2025-02-07 21:25:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110689270] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:04,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:04,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:25:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735710086] [2025-02-07 21:25:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:04,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 21:25:04,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:04,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 21:25:04,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:25:04,072 INFO L87 Difference]: Start difference. First operand 493 states and 492 transitions. Second operand has 27 states, 27 states have (on average 15.148148148148149) internal successors, (409), 27 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:05,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:05,130 INFO L93 Difference]: Finished difference Result 493 states and 492 transitions. [2025-02-07 21:25:05,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 21:25:05,131 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 15.148148148148149) internal successors, (409), 27 states have internal predecessors, (409), 0 states have call successors, (0), 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 409 [2025-02-07 21:25:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:05,133 INFO L225 Difference]: With dead ends: 493 [2025-02-07 21:25:05,133 INFO L226 Difference]: Without dead ends: 458 [2025-02-07 21:25:05,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=941, Invalid=2481, Unknown=0, NotChecked=0, Total=3422 [2025-02-07 21:25:05,135 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 1204 mSDsluCounter, 3470 mSDsCounter, 0 mSdLazyCounter, 870 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 3868 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:05,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 3868 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 870 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 21:25:05,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-02-07 21:25:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2025-02-07 21:25:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 454 states have (on average 1.0066079295154184) internal successors, (457), 457 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 457 transitions. [2025-02-07 21:25:05,145 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 457 transitions. Word has length 409 [2025-02-07 21:25:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:05,145 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 457 transitions. [2025-02-07 21:25:05,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.148148148148149) internal successors, (409), 27 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 457 transitions. [2025-02-07 21:25:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-07 21:25:05,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:05,148 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:05,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:25:05,148 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:25:05,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1873386856, now seen corresponding path program 1 times [2025-02-07 21:25:05,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:05,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978086638] [2025-02-07 21:25:05,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:05,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:05,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-07 21:25:05,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-07 21:25:05,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:05,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:25:11,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:11,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978086638] [2025-02-07 21:25:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978086638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:11,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:11,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-07 21:25:11,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065477627] [2025-02-07 21:25:11,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:11,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 21:25:11,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:11,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 21:25:11,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-02-07 21:25:11,237 INFO L87 Difference]: Start difference. First operand 458 states and 457 transitions. Second operand has 28 states, 28 states have (on average 14.607142857142858) internal successors, (409), 28 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:12,140 INFO L93 Difference]: Finished difference Result 458 states and 457 transitions. [2025-02-07 21:25:12,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 21:25:12,141 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 14.607142857142858) internal successors, (409), 28 states have internal predecessors, (409), 0 states have call successors, (0), 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 409 [2025-02-07 21:25:12,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:12,142 INFO L225 Difference]: With dead ends: 458 [2025-02-07 21:25:12,142 INFO L226 Difference]: Without dead ends: 436 [2025-02-07 21:25:12,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=863, Invalid=2329, Unknown=0, NotChecked=0, Total=3192 [2025-02-07 21:25:12,145 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 930 mSDsluCounter, 3250 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 930 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:12,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [930 Valid, 3625 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:25:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-02-07 21:25:12,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2025-02-07 21:25:12,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 433 states have (on average 1.0046189376443417) internal successors, (435), 435 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:12,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 435 transitions. [2025-02-07 21:25:12,155 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 435 transitions. Word has length 409 [2025-02-07 21:25:12,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:12,156 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 435 transitions. [2025-02-07 21:25:12,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.607142857142858) internal successors, (409), 28 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:12,157 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 435 transitions. [2025-02-07 21:25:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-07 21:25:12,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:12,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:12,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:12,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:25:12,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1781832037, now seen corresponding path program 1 times [2025-02-07 21:25:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:12,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163582252] [2025-02-07 21:25:12,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:12,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-07 21:25:12,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-07 21:25:12,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:12,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:25:17,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:17,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163582252] [2025-02-07 21:25:17,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163582252] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:17,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:17,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:25:17,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909614391] [2025-02-07 21:25:17,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:17,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 21:25:17,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:17,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 21:25:17,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:25:17,968 INFO L87 Difference]: Start difference. First operand 436 states and 435 transitions. Second operand has 27 states, 27 states have (on average 15.148148148148149) internal successors, (409), 27 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:18,906 INFO L93 Difference]: Finished difference Result 436 states and 435 transitions. [2025-02-07 21:25:18,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 21:25:18,906 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 15.148148148148149) internal successors, (409), 27 states have internal predecessors, (409), 0 states have call successors, (0), 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 409 [2025-02-07 21:25:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:18,908 INFO L225 Difference]: With dead ends: 436 [2025-02-07 21:25:18,908 INFO L226 Difference]: Without dead ends: 423 [2025-02-07 21:25:18,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=848, Invalid=2232, Unknown=0, NotChecked=0, Total=3080 [2025-02-07 21:25:18,910 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 837 mSDsluCounter, 3136 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 3498 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:18,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 3498 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:25:18,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-07 21:25:18,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2025-02-07 21:25:18,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 421 states have (on average 1.002375296912114) internal successors, (422), 422 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 422 transitions. [2025-02-07 21:25:18,915 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 422 transitions. Word has length 409 [2025-02-07 21:25:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:18,916 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 422 transitions. [2025-02-07 21:25:18,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 15.148148148148149) internal successors, (409), 27 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 422 transitions. [2025-02-07 21:25:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-02-07 21:25:18,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:18,918 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:18,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:25:18,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:25:18,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash 292622792, now seen corresponding path program 1 times [2025-02-07 21:25:18,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:18,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330428355] [2025-02-07 21:25:18,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:18,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:18,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-02-07 21:25:19,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-02-07 21:25:19,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:19,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:25:24,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:24,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330428355] [2025-02-07 21:25:24,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330428355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:24,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:24,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-07 21:25:24,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910410525] [2025-02-07 21:25:24,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:24,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 21:25:24,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:24,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 21:25:24,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-02-07 21:25:24,567 INFO L87 Difference]: Start difference. First operand 423 states and 422 transitions. Second operand has 28 states, 28 states have (on average 14.607142857142858) internal successors, (409), 28 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:25,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:25,506 INFO L93 Difference]: Finished difference Result 423 states and 422 transitions. [2025-02-07 21:25:25,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 21:25:25,506 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 14.607142857142858) internal successors, (409), 28 states have internal predecessors, (409), 0 states have call successors, (0), 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 409 [2025-02-07 21:25:25,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:25,508 INFO L225 Difference]: With dead ends: 423 [2025-02-07 21:25:25,508 INFO L226 Difference]: Without dead ends: 419 [2025-02-07 21:25:25,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=863, Invalid=2329, Unknown=0, NotChecked=0, Total=3192 [2025-02-07 21:25:25,509 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 836 mSDsluCounter, 3618 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 3976 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:25,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 3976 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:25:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-02-07 21:25:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-02-07 21:25:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.0) internal successors, (418), 418 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:25,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 418 transitions. [2025-02-07 21:25:25,515 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 418 transitions. Word has length 409 [2025-02-07 21:25:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:25,515 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 418 transitions. [2025-02-07 21:25:25,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.607142857142858) internal successors, (409), 28 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 418 transitions. [2025-02-07 21:25:25,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-02-07 21:25:25,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:25,517 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:25,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:25:25,518 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:25:25,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:25,518 INFO L85 PathProgramCache]: Analyzing trace with hash -286967265, now seen corresponding path program 1 times [2025-02-07 21:25:25,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:25,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240483890] [2025-02-07 21:25:25,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:25,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:25,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-02-07 21:25:25,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-02-07 21:25:25,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:25,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:25:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240483890] [2025-02-07 21:25:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240483890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:25,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:25,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152007641] [2025-02-07 21:25:25,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:25,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:25,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:25,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:25,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:25,736 INFO L87 Difference]: Start difference. First operand 419 states and 418 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:25,771 INFO L93 Difference]: Finished difference Result 419 states and 418 transitions. [2025-02-07 21:25:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:25,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 418 [2025-02-07 21:25:25,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:25,772 INFO L225 Difference]: With dead ends: 419 [2025-02-07 21:25:25,772 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:25:25,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:25,773 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 0 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:25,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 759 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:25:25,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:25:25,774 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-02-07 21:25:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:25:25,775 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 418 [2025-02-07 21:25:25,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:25,775 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:25:25,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:25:25,775 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:25:25,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:25:25,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 12 remaining) [2025-02-07 21:25:25,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 12 remaining) [2025-02-07 21:25:25,779 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 12 remaining) [2025-02-07 21:25:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 12 remaining) [2025-02-07 21:25:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 12 remaining) [2025-02-07 21:25:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 12 remaining) [2025-02-07 21:25:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 12 remaining) [2025-02-07 21:25:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 12 remaining) [2025-02-07 21:25:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (3 of 12 remaining) [2025-02-07 21:25:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (2 of 12 remaining) [2025-02-07 21:25:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2025-02-07 21:25:25,780 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (0 of 12 remaining) [2025-02-07 21:25:25,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:25:25,784 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:25,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:25:25,802 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:25:25,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:25:25 BoogieIcfgContainer [2025-02-07 21:25:25,811 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:25:25,811 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:25:25,811 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:25:25,812 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:25:25,813 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:24:40" (3/4) ... [2025-02-07 21:25:25,815 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:25:25,896 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:25:25,900 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:25:25,903 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 21:25:25,906 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:25:26,171 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:25:26,171 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:25:26,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:25:26,173 INFO L158 Benchmark]: Toolchain (without parser) took 50328.26ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 109.2MB in the beginning and 1.0GB in the end (delta: -901.3MB). Peak memory consumption was 355.5MB. Max. memory is 16.1GB. [2025-02-07 21:25:26,174 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:25:26,174 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1286.27ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 40.7MB in the end (delta: 68.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-07 21:25:26,174 INFO L158 Benchmark]: Boogie Procedure Inliner took 150.22ms. Allocated memory is still 142.6MB. Free memory was 40.7MB in the beginning and 90.7MB in the end (delta: -49.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2025-02-07 21:25:26,174 INFO L158 Benchmark]: Boogie Preprocessor took 123.44ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 77.3MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:25:26,174 INFO L158 Benchmark]: IcfgBuilder took 2621.28ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 77.3MB in the beginning and 238.2MB in the end (delta: -160.9MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. [2025-02-07 21:25:26,175 INFO L158 Benchmark]: TraceAbstraction took 45780.50ms. Allocated memory was 427.8MB in the beginning and 1.4GB in the end (delta: 973.1MB). Free memory was 238.2MB in the beginning and 1.0GB in the end (delta: -810.1MB). Peak memory consumption was 167.0MB. Max. memory is 16.1GB. [2025-02-07 21:25:26,175 INFO L158 Benchmark]: Witness Printer took 359.65ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:25:26,178 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 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1286.27ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 40.7MB in the end (delta: 68.2MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 150.22ms. Allocated memory is still 142.6MB. Free memory was 40.7MB in the beginning and 90.7MB in the end (delta: -49.9MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.44ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 77.3MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 2621.28ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 77.3MB in the beginning and 238.2MB in the end (delta: -160.9MB). Peak memory consumption was 242.0MB. Max. memory is 16.1GB. * TraceAbstraction took 45780.50ms. Allocated memory was 427.8MB in the beginning and 1.4GB in the end (delta: 973.1MB). Free memory was 238.2MB in the beginning and 1.0GB in the end (delta: -810.1MB). Peak memory consumption was 167.0MB. Max. memory is 16.1GB. * Witness Printer took 359.65ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. 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: 2018]: 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: 2075]: 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: 2214]: 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: 2271]: 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: 2492]: 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: 2549]: 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: 2688]: 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: 2769]: 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: 4096]: 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: 4153]: 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: 4292]: 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: 4640]: 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, 1138 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 45.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10370 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10370 mSDsluCounter, 31771 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28165 mSDsCounter, 906 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5783 IncrementalHoareTripleChecker+Invalid, 6689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 906 mSolverCounterUnsat, 3606 mSDtfsCounter, 5783 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3941 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1137occurred in iteration=0, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 36.9s InterpolantComputationTime, 2872 NumberOfCodeBlocks, 2872 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 2865 ConstructedInterpolants, 0 QuantifiedInterpolants, 18861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 21:25:26,206 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