./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.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.1.ufo.UNBOUNDED.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 8ff37a6bc6dd9a1cef87b79c0817272bb118995e5e060e5cd0eb428df45ac24f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:24:10,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:24:10,751 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:10,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:24:10,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:24:10,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:24:10,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:24:10,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:24:10,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:24:10,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:24:10,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:24:10,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:24:10,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:24:10,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:24:10,773 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:24:10,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:24:10,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:24:10,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:24:10,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:24:10,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:24:10,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:24:10,775 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 -> 8ff37a6bc6dd9a1cef87b79c0817272bb118995e5e060e5cd0eb428df45ac24f [2025-02-07 21:24:10,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:24:11,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:24:11,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:24:11,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:24:11,004 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:24:11,004 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:24:12,112 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5159878c1/b6a0b94d71344d549978b96d6a3186b2/FLAGbdf804184 [2025-02-07 21:24:12,514 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:24:12,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:24:12,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5159878c1/b6a0b94d71344d549978b96d6a3186b2/FLAGbdf804184 [2025-02-07 21:24:12,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5159878c1/b6a0b94d71344d549978b96d6a3186b2 [2025-02-07 21:24:12,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:24:12,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:24:12,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:24:12,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:24:12,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:24:12,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:24:12" (1/1) ... [2025-02-07 21:24:12,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1119beda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:12, skipping insertion in model container [2025-02-07 21:24:12,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:24:12" (1/1) ... [2025-02-07 21:24:12,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:24:13,127 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34668,34681] [2025-02-07 21:24:13,143 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35558,35571] [2025-02-07 21:24:13,157 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37388,37401] [2025-02-07 21:24:13,165 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38278,38291] [2025-02-07 21:24:13,186 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41051,41064] [2025-02-07 21:24:13,195 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41944,41957] [2025-02-07 21:24:13,208 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[43777,43790] [2025-02-07 21:24:13,223 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[45054,45067] [2025-02-07 21:24:13,306 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60707,60720] [2025-02-07 21:24:13,315 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61600,61613] [2025-02-07 21:24:13,328 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63433,63446] [2025-02-07 21:24:13,359 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67890,67903] [2025-02-07 21:24:13,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:24:13,442 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:24:13,598 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34668,34681] [2025-02-07 21:24:13,605 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35558,35571] [2025-02-07 21:24:13,617 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37388,37401] [2025-02-07 21:24:13,625 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[38278,38291] [2025-02-07 21:24:13,641 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41051,41064] [2025-02-07 21:24:13,648 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41944,41957] [2025-02-07 21:24:13,660 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[43777,43790] [2025-02-07 21:24:13,669 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[45054,45067] [2025-02-07 21:24:13,737 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[60707,60720] [2025-02-07 21:24:13,744 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61600,61613] [2025-02-07 21:24:13,755 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[63433,63446] [2025-02-07 21:24:13,782 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.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[67890,67903] [2025-02-07 21:24:13,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:24:13,869 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:24:13,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:13 WrapperNode [2025-02-07 21:24:13,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:24:13,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:24:13,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:24:13,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:24:13,874 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:13" (1/1) ... [2025-02-07 21:24:13,891 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:13" (1/1) ... [2025-02-07 21:24:13,968 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4306 [2025-02-07 21:24:13,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:24:13,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:24:13,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:24:13,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:24:13,976 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:13" (1/1) ... [2025-02-07 21:24:13,976 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:13" (1/1) ... [2025-02-07 21:24:13,992 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:13" (1/1) ... [2025-02-07 21:24:14,034 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:14,035 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:13" (1/1) ... [2025-02-07 21:24:14,035 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:13" (1/1) ... [2025-02-07 21:24:14,068 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:13" (1/1) ... [2025-02-07 21:24:14,076 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:13" (1/1) ... [2025-02-07 21:24:14,084 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:13" (1/1) ... [2025-02-07 21:24:14,090 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:13" (1/1) ... [2025-02-07 21:24:14,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:24:14,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:24:14,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:24:14,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:24:14,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:13" (1/1) ... [2025-02-07 21:24:14,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:24:14,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:24:14,125 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:14,128 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:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:24:14,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:24:14,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:24:14,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:24:14,289 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:24:14,290 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:24:16,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1955: havoc main_~node4__newmax~5#1; [2025-02-07 21:24:16,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2093: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-07 21:24:16,340 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5137: havoc main_~check__tmp~21#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5011: havoc main_~check__tmp~20#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2239: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4750: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~18#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc main_~check__tmp~13#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3563: 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:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4623: havoc main_~node3__newmax~9#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4105: havoc main_~node4__newmax~10#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2917: havoc main_~node3__newmax~7#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2653: havoc main_~node4__newmax~8#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1863: havoc main_~node2__newmax~5#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4243: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2531: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1; [2025-02-07 21:24:16,341 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2404: havoc main_~node3__newmax~6#1; [2025-02-07 21:24:16,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:24:16,342 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3728: 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:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4389: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4796: havoc main_~check__tmp~19#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2158: havoc main_~node4__newmax~6#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4669: havoc main_~node4__newmax~12#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4013: havoc main_~node2__newmax~7#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2296: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2825: havoc main_~node1__newmax~6#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4941: havoc main_~node4__newmax~13#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2036: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2963: havoc main_~node4__newmax~9#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1909: havoc main_~node3__newmax~5#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3233: 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:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2450: havoc main_~node4__newmax~7#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4435: havoc main_~check__tmp~17#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2588: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4308: havoc main_~node4__newmax~11#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4186: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-02-07 21:24:16,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2734: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1; [2025-02-07 21:24:16,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3398: 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:16,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4059: havoc main_~node3__newmax~8#1; [2025-02-07 21:24:16,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2871: havoc main_~node2__newmax~6#1; [2025-02-07 21:24:16,344 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1817: havoc main_~node1__newmax~5#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_~__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_~__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_~__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_~__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_~__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_~__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_~__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_~__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_~__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_~__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:16,580 INFO L? ?]: Removed 847 outVars from TransFormulas that were not future-live. [2025-02-07 21:24:16,580 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:24:16,600 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:24:16,600 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:24:16,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:24:16 BoogieIcfgContainer [2025-02-07 21:24:16,600 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:24:16,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:24:16,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:24:16,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:24:16,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:24:12" (1/3) ... [2025-02-07 21:24:16,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f9d741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:24:16, skipping insertion in model container [2025-02-07 21:24:16,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:24:13" (2/3) ... [2025-02-07 21:24:16,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f9d741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:24:16, skipping insertion in model container [2025-02-07 21:24:16,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:24:16" (3/3) ... [2025-02-07 21:24:16,613 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:24:16,623 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:24:16,625 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 1150 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-02-07 21:24:16,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:24:16,696 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;@45d39804, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:24:16,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-02-07 21:24:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 1149 states, 802 states have (on average 1.9987531172069826) internal successors, (1603), 1148 states have internal predecessors, (1603), 0 states have call successors, (0), 0 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:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-07 21:24:16,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:16,727 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] [2025-02-07 21:24:16,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === 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:16,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:16,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1862963355, now seen corresponding path program 1 times [2025-02-07 21:24:16,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:16,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232144559] [2025-02-07 21:24:16,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:16,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:16,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-07 21:24:17,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-07 21:24:17,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:17,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:25,123 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:25,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:25,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232144559] [2025-02-07 21:24:25,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232144559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:25,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:25,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:24:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773663320] [2025-02-07 21:24:25,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:25,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 21:24:25,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:25,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 21:24:25,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:24:25,151 INFO L87 Difference]: Start difference. First operand has 1149 states, 802 states have (on average 1.9987531172069826) internal successors, (1603), 1148 states have internal predecessors, (1603), 0 states have call successors, (0), 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 14.925925925925926) internal successors, (403), 27 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:27,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:27,313 INFO L93 Difference]: Finished difference Result 1192 states and 1603 transitions. [2025-02-07 21:24:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-07 21:24:27,315 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 14.925925925925926) internal successors, (403), 27 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-02-07 21:24:27,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:27,322 INFO L225 Difference]: With dead ends: 1192 [2025-02-07 21:24:27,323 INFO L226 Difference]: Without dead ends: 521 [2025-02-07 21:24:27,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1135, Invalid=2897, Unknown=0, NotChecked=0, Total=4032 [2025-02-07 21:24:27,329 INFO L435 NwaCegarLoop]: 1321 mSDtfsCounter, 6463 mSDsluCounter, 14536 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6463 SdHoareTripleChecker+Valid, 15857 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:27,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6463 Valid, 15857 Invalid, 2763 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [454 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-07 21:24:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-02-07 21:24:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2025-02-07 21:24:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 513 states have (on average 1.01364522417154) internal successors, (520), 520 states have internal predecessors, (520), 0 states have call successors, (0), 0 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:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 520 transitions. [2025-02-07 21:24:27,380 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 520 transitions. Word has length 403 [2025-02-07 21:24:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:27,381 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 520 transitions. [2025-02-07 21:24:27,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 14.925925925925926) internal successors, (403), 27 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 520 transitions. [2025-02-07 21:24:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-07 21:24:27,388 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:27,388 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] [2025-02-07 21:24:27,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:24:27,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:27,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash 727407387, now seen corresponding path program 1 times [2025-02-07 21:24:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:27,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205802078] [2025-02-07 21:24:27,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:27,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-07 21:24:27,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-07 21:24:27,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:27,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:32,745 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:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205802078] [2025-02-07 21:24:32,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205802078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:32,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:32,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:24:32,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57504155] [2025-02-07 21:24:32,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:32,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 21:24:32,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:32,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 21:24:32,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:24:32,749 INFO L87 Difference]: Start difference. First operand 521 states and 520 transitions. Second operand has 27 states, 27 states have (on average 14.925925925925926) internal successors, (403), 27 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:33,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:33,798 INFO L93 Difference]: Finished difference Result 521 states and 520 transitions. [2025-02-07 21:24:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 21:24:33,799 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 14.925925925925926) internal successors, (403), 27 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-02-07 21:24:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:33,801 INFO L225 Difference]: With dead ends: 521 [2025-02-07 21:24:33,801 INFO L226 Difference]: Without dead ends: 493 [2025-02-07 21:24:33,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=935, Invalid=2487, Unknown=0, NotChecked=0, Total=3422 [2025-02-07 21:24:33,803 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 1088 mSDsluCounter, 3977 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 4392 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:33,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 4392 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 21:24:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-02-07 21:24:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2025-02-07 21:24:33,812 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:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 492 transitions. [2025-02-07 21:24:33,813 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 492 transitions. Word has length 403 [2025-02-07 21:24:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:33,814 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 492 transitions. [2025-02-07 21:24:33,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 14.925925925925926) internal successors, (403), 27 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 492 transitions. [2025-02-07 21:24:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-07 21:24:33,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:33,817 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] [2025-02-07 21:24:33,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:24:33,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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:33,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:33,818 INFO L85 PathProgramCache]: Analyzing trace with hash 72132667, now seen corresponding path program 1 times [2025-02-07 21:24:33,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:33,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510939890] [2025-02-07 21:24:33,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:33,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:33,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-07 21:24:33,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-07 21:24:33,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:33,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:24:38,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:38,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510939890] [2025-02-07 21:24:38,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510939890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:38,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:38,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-07 21:24:38,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029660657] [2025-02-07 21:24:38,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:38,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 21:24:38,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:38,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 21:24:38,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-02-07 21:24:38,984 INFO L87 Difference]: Start difference. First operand 493 states and 492 transitions. Second operand has 28 states, 28 states have (on average 14.392857142857142) internal successors, (403), 28 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:39,858 INFO L93 Difference]: Finished difference Result 493 states and 492 transitions. [2025-02-07 21:24:39,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 21:24:39,859 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 14.392857142857142) internal successors, (403), 28 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-02-07 21:24:39,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:39,860 INFO L225 Difference]: With dead ends: 493 [2025-02-07 21:24:39,861 INFO L226 Difference]: Without dead ends: 455 [2025-02-07 21:24:39,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=959, Invalid=2581, Unknown=0, NotChecked=0, Total=3540 [2025-02-07 21:24:39,862 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 856 mSDsluCounter, 3249 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:39,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 3652 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:24:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-02-07 21:24:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455. [2025-02-07 21:24:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 451 states have (on average 1.0066518847006651) internal successors, (454), 454 states have internal predecessors, (454), 0 states have call successors, (0), 0 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:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 454 transitions. [2025-02-07 21:24:39,875 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 454 transitions. Word has length 403 [2025-02-07 21:24:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:39,876 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 454 transitions. [2025-02-07 21:24:39,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.392857142857142) internal successors, (403), 28 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 454 transitions. [2025-02-07 21:24:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-07 21:24:39,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:39,879 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] [2025-02-07 21:24:39,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:24:39,879 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:24:39,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash 884268059, now seen corresponding path program 1 times [2025-02-07 21:24:39,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:39,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073436790] [2025-02-07 21:24:39,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:39,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-07 21:24:39,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-07 21:24:39,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:39,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:44,618 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:44,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:44,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073436790] [2025-02-07 21:24:44,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073436790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:44,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:44,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-07 21:24:44,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200430199] [2025-02-07 21:24:44,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:44,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 21:24:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:44,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 21:24:44,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-02-07 21:24:44,620 INFO L87 Difference]: Start difference. First operand 455 states and 454 transitions. Second operand has 28 states, 28 states have (on average 14.392857142857142) internal successors, (403), 28 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:45,347 INFO L93 Difference]: Finished difference Result 455 states and 454 transitions. [2025-02-07 21:24:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 21:24:45,347 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 14.392857142857142) internal successors, (403), 28 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-02-07 21:24:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:45,349 INFO L225 Difference]: With dead ends: 455 [2025-02-07 21:24:45,349 INFO L226 Difference]: Without dead ends: 431 [2025-02-07 21:24:45,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=863, Invalid=2329, Unknown=0, NotChecked=0, Total=3192 [2025-02-07 21:24:45,351 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 640 mSDsluCounter, 3405 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 3775 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:45,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 3775 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:24:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-07 21:24:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-02-07 21:24:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 428 states have (on average 1.0046728971962617) internal successors, (430), 430 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:45,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 430 transitions. [2025-02-07 21:24:45,360 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 430 transitions. Word has length 403 [2025-02-07 21:24:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:45,361 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 430 transitions. [2025-02-07 21:24:45,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.392857142857142) internal successors, (403), 28 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 430 transitions. [2025-02-07 21:24:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-07 21:24:45,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:45,381 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:24:45,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:24:45,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:45,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1429800155, now seen corresponding path program 1 times [2025-02-07 21:24:45,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:45,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677105216] [2025-02-07 21:24:45,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:45,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-07 21:24:45,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-07 21:24:45,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:45,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:24:50,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:50,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677105216] [2025-02-07 21:24:50,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677105216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:50,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:50,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-07 21:24:50,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722224110] [2025-02-07 21:24:50,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:50,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 21:24:50,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:50,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 21:24:50,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-02-07 21:24:50,645 INFO L87 Difference]: Start difference. First operand 431 states and 430 transitions. Second operand has 28 states, 28 states have (on average 14.392857142857142) internal successors, (403), 28 states have internal predecessors, (403), 0 states have call successors, (0), 0 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,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:51,359 INFO L93 Difference]: Finished difference Result 431 states and 430 transitions. [2025-02-07 21:24:51,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 21:24:51,360 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 14.392857142857142) internal successors, (403), 28 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-02-07 21:24:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:51,361 INFO L225 Difference]: With dead ends: 431 [2025-02-07 21:24:51,361 INFO L226 Difference]: Without dead ends: 427 [2025-02-07 21:24:51,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=863, Invalid=2329, Unknown=0, NotChecked=0, Total=3192 [2025-02-07 21:24:51,363 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 879 mSDsluCounter, 3554 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 3915 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:51,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 3915 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:24:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-02-07 21:24:51,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-02-07 21:24:51,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 425 states have (on average 1.0023529411764707) internal successors, (426), 426 states have internal predecessors, (426), 0 states have call successors, (0), 0 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,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 426 transitions. [2025-02-07 21:24:51,370 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 426 transitions. Word has length 403 [2025-02-07 21:24:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:51,370 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 426 transitions. [2025-02-07 21:24:51,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.392857142857142) internal successors, (403), 28 states have internal predecessors, (403), 0 states have call successors, (0), 0 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,370 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 426 transitions. [2025-02-07 21:24:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2025-02-07 21:24:51,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:51,372 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] [2025-02-07 21:24:51,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:24:51,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 9 more)] === [2025-02-07 21:24:51,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash 929062459, now seen corresponding path program 1 times [2025-02-07 21:24:51,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:51,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723511091] [2025-02-07 21:24:51,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:51,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:51,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-07 21:24:51,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-07 21:24:51,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:51,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:56,384 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:56,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:56,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723511091] [2025-02-07 21:24:56,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723511091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:56,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:56,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:24:56,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802364946] [2025-02-07 21:24:56,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:56,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 21:24:56,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:56,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 21:24:56,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:24:56,386 INFO L87 Difference]: Start difference. First operand 427 states and 426 transitions. Second operand has 27 states, 27 states have (on average 14.925925925925926) internal successors, (403), 27 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:57,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:57,098 INFO L93 Difference]: Finished difference Result 427 states and 426 transitions. [2025-02-07 21:24:57,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 21:24:57,098 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 14.925925925925926) internal successors, (403), 27 states have internal predecessors, (403), 0 states have call successors, (0), 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 403 [2025-02-07 21:24:57,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:57,100 INFO L225 Difference]: With dead ends: 427 [2025-02-07 21:24:57,100 INFO L226 Difference]: Without dead ends: 413 [2025-02-07 21:24:57,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=848, Invalid=2232, Unknown=0, NotChecked=0, Total=3080 [2025-02-07 21:24:57,101 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 867 mSDsluCounter, 2780 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 3132 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:24:57,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 3132 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:24:57,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-07 21:24:57,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-02-07 21:24:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.0) internal successors, (412), 412 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 412 transitions. [2025-02-07 21:24:57,106 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 412 transitions. Word has length 403 [2025-02-07 21:24:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:57,107 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 412 transitions. [2025-02-07 21:24:57,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 14.925925925925926) internal successors, (403), 27 states have internal predecessors, (403), 0 states have call successors, (0), 0 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:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 412 transitions. [2025-02-07 21:24:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-02-07 21:24:57,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:24:57,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:24:57,109 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:24:57,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:24:57,109 INFO L85 PathProgramCache]: Analyzing trace with hash -649517109, now seen corresponding path program 1 times [2025-02-07 21:24:57,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:24:57,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992438306] [2025-02-07 21:24:57,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:24:57,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:24:57,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-02-07 21:24:57,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-02-07 21:24:57,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:24:57,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:24:57,300 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,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:24:57,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992438306] [2025-02-07 21:24:57,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992438306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:24:57,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:24:57,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:24:57,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976704485] [2025-02-07 21:24:57,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:24:57,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:24:57,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:24:57,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:24:57,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:24:57,302 INFO L87 Difference]: Start difference. First operand 413 states and 412 transitions. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:57,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:24:57,331 INFO L93 Difference]: Finished difference Result 413 states and 412 transitions. [2025-02-07 21:24:57,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:24:57,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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 412 [2025-02-07 21:24:57,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:24:57,332 INFO L225 Difference]: With dead ends: 413 [2025-02-07 21:24:57,332 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:24:57,333 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:24:57,333 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 0 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 744 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:24:57,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 744 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:24:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:24:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:24:57,334 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:24:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:24:57,334 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 412 [2025-02-07 21:24:57,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:24:57,334 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:24:57,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:24:57,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:24:57,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 12 remaining) [2025-02-07 21:24:57,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (10 of 12 remaining) [2025-02-07 21:24:57,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (9 of 12 remaining) [2025-02-07 21:24:57,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (8 of 12 remaining) [2025-02-07 21:24:57,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 12 remaining) [2025-02-07 21:24:57,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 12 remaining) [2025-02-07 21:24:57,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (5 of 12 remaining) [2025-02-07 21:24:57,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (4 of 12 remaining) [2025-02-07 21:24:57,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (3 of 12 remaining) [2025-02-07 21:24:57,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (2 of 12 remaining) [2025-02-07 21:24:57,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (1 of 12 remaining) [2025-02-07 21:24:57,338 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (0 of 12 remaining) [2025-02-07 21:24:57,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:24:57,342 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:24:57,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:24:57,349 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:24:57,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:24:57 BoogieIcfgContainer [2025-02-07 21:24:57,359 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:24:57,360 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:24:57,360 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:24:57,360 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:24:57,361 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:16" (3/4) ... [2025-02-07 21:24:57,362 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:24:57,392 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:24:57,395 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:24:57,398 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 21:24:57,401 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:24:57,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:24:57,567 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:24:57,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:24:57,568 INFO L158 Benchmark]: Toolchain (without parser) took 44873.51ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 108.8MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 171.0MB. Max. memory is 16.1GB. [2025-02-07 21:24:57,568 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:24:57,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1173.65ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 101.2MB in the end (delta: 7.2MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2025-02-07 21:24:57,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.63ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 82.2MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:24:57,569 INFO L158 Benchmark]: Boogie Preprocessor took 129.18ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 68.8MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:24:57,570 INFO L158 Benchmark]: IcfgBuilder took 2501.26ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 68.8MB in the beginning and 175.6MB in the end (delta: -106.8MB). Peak memory consumption was 124.0MB. Max. memory is 16.1GB. [2025-02-07 21:24:57,571 INFO L158 Benchmark]: TraceAbstraction took 40751.37ms. Allocated memory was 243.3MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 174.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. [2025-02-07 21:24:57,571 INFO L158 Benchmark]: Witness Printer took 207.26ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 41.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:24:57,573 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.18ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1173.65ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 101.2MB in the end (delta: 7.2MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.63ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 82.2MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.18ms. Allocated memory is still 142.6MB. Free memory was 82.2MB in the beginning and 68.8MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 2501.26ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 68.8MB in the beginning and 175.6MB in the end (delta: -106.8MB). Peak memory consumption was 124.0MB. Max. memory is 16.1GB. * TraceAbstraction took 40751.37ms. Allocated memory was 243.3MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 174.3MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 104.2MB. Max. memory is 16.1GB. * Witness Printer took 207.26ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 41.9MB). 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: 2043]: 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: 2100]: 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: 2246]: 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: 2303]: 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: 2538]: 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: 2595]: 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: 2741]: 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: 2820]: 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: 4193]: 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: 4250]: 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: 4396]: 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: 4757]: 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, 1150 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 40.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10793 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10793 mSDsluCounter, 35467 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31839 mSDsCounter, 925 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6441 IncrementalHoareTripleChecker+Invalid, 7366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 925 mSolverCounterUnsat, 3628 mSDtfsCounter, 6441 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 342 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3943 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1149occurred 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, 0.8s SatisfiabilityAnalysisTime, 32.9s InterpolantComputationTime, 2830 NumberOfCodeBlocks, 2830 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 2823 ConstructedInterpolants, 0 QuantifiedInterpolants, 19189 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:24:57,588 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