./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.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_lcr.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 a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:22:33,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:22:34,000 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:22:34,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:22:34,011 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:22:34,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:22:34,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:22:34,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:22:34,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:22:34,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:22:34,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:22:34,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:22:34,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:22:34,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:22:34,030 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:22:34,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:22:34,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:22:34,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:22:34,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:22:34,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:22:34,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:22:34,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:22:34,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:34,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:22:34,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:22:34,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:22:34,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:22:34,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:22:34,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:22:34,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:22:34,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:22:34,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:22:34,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:22:34,033 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 -> a7fe14b036c76813552f56a0b0f6fa4a7e816ada4aa4a291eafd4277fae7b99b [2025-02-07 21:22:34,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:22:34,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:22:34,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:22:34,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:22:34,250 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:22:34,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:22:35,519 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/809023b91/735a5e0d6a304dedb74d77b7e6c3e19e/FLAG85f34c575 [2025-02-07 21:22:35,975 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:22:35,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:22:36,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/809023b91/735a5e0d6a304dedb74d77b7e6c3e19e/FLAG85f34c575 [2025-02-07 21:22:36,101 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/809023b91/735a5e0d6a304dedb74d77b7e6c3e19e [2025-02-07 21:22:36,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:22:36,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:22:36,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:36,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:22:36,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:22:36,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:36" (1/1) ... [2025-02-07 21:22:36,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8021687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:36, skipping insertion in model container [2025-02-07 21:22:36,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:36" (1/1) ... [2025-02-07 21:22:36,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:22:36,500 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2025-02-07 21:22:36,531 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2025-02-07 21:22:36,543 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2025-02-07 21:22:36,552 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2025-02-07 21:22:36,566 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2025-02-07 21:22:36,575 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2025-02-07 21:22:36,590 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2025-02-07 21:22:36,609 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2025-02-07 21:22:36,612 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2025-02-07 21:22:36,618 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2025-02-07 21:22:36,626 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2025-02-07 21:22:36,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:36,804 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:22:36,884 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[8893,8906] [2025-02-07 21:22:36,906 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12165,12178] [2025-02-07 21:22:36,917 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13321,13334] [2025-02-07 21:22:36,919 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13977,13990] [2025-02-07 21:22:36,922 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[15456,15469] [2025-02-07 21:22:36,932 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16112,16125] [2025-02-07 21:22:36,942 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[17096,17109] [2025-02-07 21:22:36,954 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19392,19405] [2025-02-07 21:22:36,960 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20051,20064] [2025-02-07 21:22:36,965 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21033,21046] [2025-02-07 21:22:36,977 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_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22824,22837] [2025-02-07 21:22:37,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:37,088 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:22:37,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37 WrapperNode [2025-02-07 21:22:37,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:37,093 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:37,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:22:37,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:22:37,102 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:22:37" (1/1) ... [2025-02-07 21:22:37,132 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:22:37" (1/1) ... [2025-02-07 21:22:37,214 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1924 [2025-02-07 21:22:37,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:37,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:22:37,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:22:37,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:22:37,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (1/1) ... [2025-02-07 21:22:37,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (1/1) ... [2025-02-07 21:22:37,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (1/1) ... [2025-02-07 21:22:37,290 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:22:37,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (1/1) ... [2025-02-07 21:22:37,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (1/1) ... [2025-02-07 21:22:37,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (1/1) ... [2025-02-07 21:22:37,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (1/1) ... [2025-02-07 21:22:37,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (1/1) ... [2025-02-07 21:22:37,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (1/1) ... [2025-02-07 21:22:37,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:22:37,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:22:37,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:22:37,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:22:37,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (1/1) ... [2025-02-07 21:22:37,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:37,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:22:37,428 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:22:37,435 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:22:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:22:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:22:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:22:37,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:22:37,588 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:22:37,589 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:22:38,713 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1624: havoc main_~check__tmp~15#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1558: havoc main_~node4__m4~8#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2748: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1592: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2782: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L338: havoc main_~node4__m4~1#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1329: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2849: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2420: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L240: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L769: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2454: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L968: havoc main_~node3__m3~3#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc main_~node4__m4~2#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2521: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2__m2~1#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2226: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L410: havoc main_~node2__m2~2#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2260: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-02-07 21:22:38,714 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2327: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L908: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1272: havoc main_~node3__m3~4#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1074: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1999: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L480: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L550: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L286: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2731: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc main_~node3__m3~5#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1378: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L189: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1;#t~ret21#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_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;assume { :end_inline_main } true; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2072: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: havoc main_~node4__m4~3#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2403: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2106: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc main_~node4__m4~4#1; [2025-02-07 21:22:38,715 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L323: havoc main_~node3__m3~1#1; [2025-02-07 21:22:38,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1182: havoc main_~check__tmp~9#1; [2025-02-07 21:22:38,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1116: havoc main_~node4__m4~5#1; [2025-02-07 21:22:38,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2173: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-02-07 21:22:38,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L390: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-07 21:22:38,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1150: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-07 21:22:38,716 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:22:38,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2902: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-02-07 21:22:38,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1845: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-07 21:22:38,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L425: havoc main_~node3__m3~2#1; [2025-02-07 21:22:38,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2936: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-02-07 21:22:38,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3003: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-02-07 21:22:38,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:38,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2574: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-02-07 21:22:38,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2608: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-02-07 21:22:38,717 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1287: havoc main_~node4__m4~6#1; [2025-02-07 21:22:38,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2675: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-02-07 21:22:38,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1486: havoc main_~check__tmp~13#1; [2025-02-07 21:22:38,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1420: havoc main_~node4__m4~7#1; [2025-02-07 21:22:38,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L859: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-07 21:22:38,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L595: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:38,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1454: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-07 21:22:38,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1025: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-07 21:22:38,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1686: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-02-07 21:22:38,718 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1257: havoc main_~node2__m2~3#1; [2025-02-07 21:22:38,786 INFO L? ?]: Removed 488 outVars from TransFormulas that were not future-live. [2025-02-07 21:22:38,786 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:22:38,805 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:22:38,805 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:22:38,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:38 BoogieIcfgContainer [2025-02-07 21:22:38,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:22:38,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:22:38,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:22:38,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:22:38,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:22:36" (1/3) ... [2025-02-07 21:22:38,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56155a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:22:38, skipping insertion in model container [2025-02-07 21:22:38,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:37" (2/3) ... [2025-02-07 21:22:38,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56155a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:22:38, skipping insertion in model container [2025-02-07 21:22:38,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:38" (3/3) ... [2025-02-07 21:22:38,819 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-07 21:22:38,839 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:22:38,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 359 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-02-07 21:22:38,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:22:38,933 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;@e7b5414, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:22:38,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-07 21:22:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 290 states have (on average 1.9965517241379311) internal successors, (579), 357 states have internal predecessors, (579), 0 states have call successors, (0), 0 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:22:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 21:22:38,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:38,953 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] [2025-02-07 21:22:38,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:38,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:38,959 INFO L85 PathProgramCache]: Analyzing trace with hash -436498308, now seen corresponding path program 1 times [2025-02-07 21:22:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253140662] [2025-02-07 21:22:38,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:38,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:39,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-07 21:22:39,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 21:22:39,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:39,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:41,248 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:22:41,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253140662] [2025-02-07 21:22:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253140662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:41,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:41,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-07 21:22:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335475582] [2025-02-07 21:22:41,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:41,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 21:22:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:41,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 21:22:41,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-02-07 21:22:41,267 INFO L87 Difference]: Start difference. First operand has 358 states, 290 states have (on average 1.9965517241379311) internal successors, (579), 357 states have internal predecessors, (579), 0 states have call successors, (0), 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 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:22:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:43,188 INFO L93 Difference]: Finished difference Result 378 states and 579 transitions. [2025-02-07 21:22:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 21:22:43,189 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-07 21:22:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:43,194 INFO L225 Difference]: With dead ends: 378 [2025-02-07 21:22:43,194 INFO L226 Difference]: Without dead ends: 162 [2025-02-07 21:22:43,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=315, Invalid=1407, Unknown=0, NotChecked=0, Total=1722 [2025-02-07 21:22:43,198 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 1946 mSDsluCounter, 4909 mSDsCounter, 0 mSdLazyCounter, 2033 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1946 SdHoareTripleChecker+Valid, 5370 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:43,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1946 Valid, 5370 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2033 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-07 21:22:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-07 21:22:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-07 21:22:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 152 states have (on average 1.0592105263157894) internal successors, (161), 161 states have internal predecessors, (161), 0 states have call successors, (0), 0 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:22:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 161 transitions. [2025-02-07 21:22:43,220 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 161 transitions. Word has length 60 [2025-02-07 21:22:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:43,220 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 161 transitions. [2025-02-07 21:22:43,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:22:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 161 transitions. [2025-02-07 21:22:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 21:22:43,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:43,222 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] [2025-02-07 21:22:43,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:22:43,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:43,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:43,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1383236990, now seen corresponding path program 1 times [2025-02-07 21:22:43,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:43,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012183051] [2025-02-07 21:22:43,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:43,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-07 21:22:43,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 21:22:43,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:43,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:44,910 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:22:44,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:44,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012183051] [2025-02-07 21:22:44,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012183051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:44,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:44,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-07 21:22:44,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250755833] [2025-02-07 21:22:44,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:44,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 21:22:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:44,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 21:22:44,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2025-02-07 21:22:44,914 INFO L87 Difference]: Start difference. First operand 162 states and 161 transitions. Second operand has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:22:46,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:46,591 INFO L93 Difference]: Finished difference Result 162 states and 161 transitions. [2025-02-07 21:22:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 21:22:46,592 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-07 21:22:46,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:46,594 INFO L225 Difference]: With dead ends: 162 [2025-02-07 21:22:46,595 INFO L226 Difference]: Without dead ends: 154 [2025-02-07 21:22:46,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2025-02-07 21:22:46,596 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 368 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:46,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1672 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:22:46,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-07 21:22:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-02-07 21:22:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 145 states have (on average 1.0551724137931036) internal successors, (153), 153 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:22:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 153 transitions. [2025-02-07 21:22:46,605 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 153 transitions. Word has length 60 [2025-02-07 21:22:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:46,606 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 153 transitions. [2025-02-07 21:22:46,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:22:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 153 transitions. [2025-02-07 21:22:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 21:22:46,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:46,608 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:46,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:22:46,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:46,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:46,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1074056292, now seen corresponding path program 1 times [2025-02-07 21:22:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:46,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437902863] [2025-02-07 21:22:46,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:46,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:46,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-07 21:22:46,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 21:22:46,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:46,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:47,060 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:22:47,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:47,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437902863] [2025-02-07 21:22:47,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437902863] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:47,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:47,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:22:47,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003209556] [2025-02-07 21:22:47,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:47,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:22:47,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:47,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:22:47,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:22:47,061 INFO L87 Difference]: Start difference. First operand 154 states and 153 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:22:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:47,417 INFO L93 Difference]: Finished difference Result 154 states and 153 transitions. [2025-02-07 21:22:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:22:47,418 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-07 21:22:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:47,420 INFO L225 Difference]: With dead ends: 154 [2025-02-07 21:22:47,420 INFO L226 Difference]: Without dead ends: 143 [2025-02-07 21:22:47,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:47,421 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 267 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:47,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 932 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:22:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-02-07 21:22:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-02-07 21:22:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 135 states have (on average 1.0518518518518518) internal successors, (142), 142 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:22:47,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 142 transitions. [2025-02-07 21:22:47,432 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 142 transitions. Word has length 60 [2025-02-07 21:22:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:47,433 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 142 transitions. [2025-02-07 21:22:47,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:22:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 142 transitions. [2025-02-07 21:22:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 21:22:47,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:47,434 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] [2025-02-07 21:22:47,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:22:47,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:47,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash -46414754, now seen corresponding path program 1 times [2025-02-07 21:22:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:47,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98472773] [2025-02-07 21:22:47,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:47,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:47,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-07 21:22:47,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 21:22:47,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:47,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:47,926 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:22:47,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:47,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98472773] [2025-02-07 21:22:47,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98472773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:47,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:47,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:22:47,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40316948] [2025-02-07 21:22:47,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:47,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:22:47,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:47,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:22:47,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:22:47,930 INFO L87 Difference]: Start difference. First operand 143 states and 142 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:22:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:48,305 INFO L93 Difference]: Finished difference Result 143 states and 142 transitions. [2025-02-07 21:22:48,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:22:48,306 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-07 21:22:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:48,306 INFO L225 Difference]: With dead ends: 143 [2025-02-07 21:22:48,306 INFO L226 Difference]: Without dead ends: 117 [2025-02-07 21:22:48,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:48,307 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 214 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:48,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 740 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:22:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-07 21:22:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-07 21:22:48,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.0357142857142858) internal successors, (116), 116 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 116 transitions. [2025-02-07 21:22:48,311 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 116 transitions. Word has length 60 [2025-02-07 21:22:48,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:48,311 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 116 transitions. [2025-02-07 21:22:48,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:22:48,311 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 116 transitions. [2025-02-07 21:22:48,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-07 21:22:48,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:48,312 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] [2025-02-07 21:22:48,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:22:48,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:48,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash -717779523, now seen corresponding path program 1 times [2025-02-07 21:22:48,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507005232] [2025-02-07 21:22:48,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:48,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-07 21:22:48,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-07 21:22:48,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:48,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:49,260 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:22:49,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:49,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507005232] [2025-02-07 21:22:49,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507005232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:49,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:49,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-02-07 21:22:49,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20629354] [2025-02-07 21:22:49,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:49,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-07 21:22:49,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:49,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-07 21:22:49,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2025-02-07 21:22:49,264 INFO L87 Difference]: Start difference. First operand 117 states and 116 transitions. Second operand has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:22:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:50,234 INFO L93 Difference]: Finished difference Result 117 states and 116 transitions. [2025-02-07 21:22:50,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-07 21:22:50,235 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-02-07 21:22:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:50,236 INFO L225 Difference]: With dead ends: 117 [2025-02-07 21:22:50,236 INFO L226 Difference]: Without dead ends: 112 [2025-02-07 21:22:50,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=290, Invalid=1516, Unknown=0, NotChecked=0, Total=1806 [2025-02-07 21:22:50,237 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 328 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:50,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 981 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:22:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-07 21:22:50,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-07 21:22:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 111 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 111 transitions. [2025-02-07 21:22:50,240 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 111 transitions. Word has length 60 [2025-02-07 21:22:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:50,241 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 111 transitions. [2025-02-07 21:22:50,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5) internal successors, (60), 23 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:22:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 111 transitions. [2025-02-07 21:22:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 21:22:50,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:50,242 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] [2025-02-07 21:22:50,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:22:50,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:50,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1118956053, now seen corresponding path program 1 times [2025-02-07 21:22:50,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:50,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427754186] [2025-02-07 21:22:50,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:50,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-07 21:22:50,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 21:22:50,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:50,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:50,742 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:22:50,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:50,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427754186] [2025-02-07 21:22:50,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427754186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:50,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:50,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-07 21:22:50,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702120446] [2025-02-07 21:22:50,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:50,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 21:22:50,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:50,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 21:22:50,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-02-07 21:22:50,744 INFO L87 Difference]: Start difference. First operand 112 states and 111 transitions. Second operand has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:22:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:51,197 INFO L93 Difference]: Finished difference Result 112 states and 111 transitions. [2025-02-07 21:22:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 21:22:51,198 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-02-07 21:22:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:51,198 INFO L225 Difference]: With dead ends: 112 [2025-02-07 21:22:51,198 INFO L226 Difference]: Without dead ends: 96 [2025-02-07 21:22:51,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2025-02-07 21:22:51,199 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 212 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:51,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 567 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:22:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-07 21:22:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-07 21:22:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 93 states have (on average 1.021505376344086) internal successors, (95), 95 states have internal predecessors, (95), 0 states have call successors, (0), 0 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:22:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 95 transitions. [2025-02-07 21:22:51,205 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 95 transitions. Word has length 61 [2025-02-07 21:22:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:51,205 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 95 transitions. [2025-02-07 21:22:51,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.066666666666666) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:22:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 95 transitions. [2025-02-07 21:22:51,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 21:22:51,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:51,205 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] [2025-02-07 21:22:51,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:22:51,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:51,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:51,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1248739275, now seen corresponding path program 1 times [2025-02-07 21:22:51,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:51,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219510001] [2025-02-07 21:22:51,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:51,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:51,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-07 21:22:51,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 21:22:51,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:51,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:52,112 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:22:52,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:52,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219510001] [2025-02-07 21:22:52,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219510001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:52,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:52,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-07 21:22:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760824589] [2025-02-07 21:22:52,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:52,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 21:22:52,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:52,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 21:22:52,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:52,115 INFO L87 Difference]: Start difference. First operand 96 states and 95 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:22:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:52,951 INFO L93 Difference]: Finished difference Result 96 states and 95 transitions. [2025-02-07 21:22:52,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 21:22:52,952 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-02-07 21:22:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:52,953 INFO L225 Difference]: With dead ends: 96 [2025-02-07 21:22:52,953 INFO L226 Difference]: Without dead ends: 86 [2025-02-07 21:22:52,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2025-02-07 21:22:52,954 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 281 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:52,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 607 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:22:52,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-07 21:22:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-07 21:22:52,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 84 states have (on average 1.0119047619047619) internal successors, (85), 85 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:52,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 85 transitions. [2025-02-07 21:22:52,958 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 85 transitions. Word has length 61 [2025-02-07 21:22:52,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:52,959 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 85 transitions. [2025-02-07 21:22:52,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:22:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 85 transitions. [2025-02-07 21:22:52,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 21:22:52,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:52,959 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] [2025-02-07 21:22:52,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:22:52,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:52,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:52,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1692736717, now seen corresponding path program 1 times [2025-02-07 21:22:52,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:52,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153047613] [2025-02-07 21:22:52,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:52,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:52,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-07 21:22:52,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 21:22:52,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:52,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:53,664 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:22:53,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:53,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153047613] [2025-02-07 21:22:53,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153047613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:53,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:53,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-07 21:22:53,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599770020] [2025-02-07 21:22:53,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:53,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 21:22:53,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:53,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 21:22:53,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:53,667 INFO L87 Difference]: Start difference. First operand 86 states and 85 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:22:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:54,344 INFO L93 Difference]: Finished difference Result 86 states and 85 transitions. [2025-02-07 21:22:54,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 21:22:54,345 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-02-07 21:22:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:54,346 INFO L225 Difference]: With dead ends: 86 [2025-02-07 21:22:54,346 INFO L226 Difference]: Without dead ends: 79 [2025-02-07 21:22:54,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2025-02-07 21:22:54,347 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 200 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:54,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 634 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:22:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-07 21:22:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-02-07 21:22:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0) internal successors, (78), 78 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 78 transitions. [2025-02-07 21:22:54,352 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 78 transitions. Word has length 61 [2025-02-07 21:22:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:54,352 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 78 transitions. [2025-02-07 21:22:54,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:22:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 78 transitions. [2025-02-07 21:22:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-07 21:22:54,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:54,354 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:54,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:22:54,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:54,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:54,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1486923645, now seen corresponding path program 1 times [2025-02-07 21:22:54,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:54,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487749275] [2025-02-07 21:22:54,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:54,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:54,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-07 21:22:54,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-07 21:22:54,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:54,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:54,406 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:22:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:54,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487749275] [2025-02-07 21:22:54,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487749275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:54,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:54,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:22:54,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122021733] [2025-02-07 21:22:54,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:54,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:22:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:54,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:22:54,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:22:54,407 INFO L87 Difference]: Start difference. First operand 79 states and 78 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:54,423 INFO L93 Difference]: Finished difference Result 79 states and 78 transitions. [2025-02-07 21:22:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:22:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-02-07 21:22:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:54,424 INFO L225 Difference]: With dead ends: 79 [2025-02-07 21:22:54,424 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:22:54,424 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:22:54,424 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:54,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:22:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:22:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:22:54,425 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:22:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:22:54,425 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2025-02-07 21:22:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:54,425 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:22:54,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:22:54,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:22:54,430 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-02-07 21:22:54,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2025-02-07 21:22:54,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2025-02-07 21:22:54,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2025-02-07 21:22:54,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2025-02-07 21:22:54,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2025-02-07 21:22:54,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2025-02-07 21:22:54,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2025-02-07 21:22:54,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2025-02-07 21:22:54,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2025-02-07 21:22:54,431 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2025-02-07 21:22:54,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:22:54,433 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:54,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:22:54,440 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:22:54,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:22:54 BoogieIcfgContainer [2025-02-07 21:22:54,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:22:54,447 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:22:54,447 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:22:54,447 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:22:54,448 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:38" (3/4) ... [2025-02-07 21:22:54,450 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:22:54,474 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:22:54,475 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:22:54,476 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 21:22:54,477 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:22:54,621 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:22:54,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:22:54,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:22:54,623 INFO L158 Benchmark]: Toolchain (without parser) took 18519.52ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 111.0MB in the beginning and 449.5MB in the end (delta: -338.5MB). Peak memory consumption was 310.9MB. Max. memory is 16.1GB. [2025-02-07 21:22:54,623 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:22:54,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 987.98ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 73.5MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 21:22:54,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.41ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 65.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:22:54,624 INFO L158 Benchmark]: Boogie Preprocessor took 165.17ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 58.8MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:22:54,624 INFO L158 Benchmark]: IcfgBuilder took 1424.08ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 57.3MB in the end (delta: 1.5MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2025-02-07 21:22:54,624 INFO L158 Benchmark]: TraceAbstraction took 15639.74ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 56.0MB in the beginning and 177.2MB in the end (delta: -121.2MB). Peak memory consumption was 240.3MB. Max. memory is 16.1GB. [2025-02-07 21:22:54,624 INFO L158 Benchmark]: Witness Printer took 175.30ms. Allocated memory is still 503.3MB. Free memory was 177.2MB in the beginning and 449.5MB in the end (delta: -272.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2025-02-07 21:22:54,625 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.14ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 987.98ms. Allocated memory is still 142.6MB. Free memory was 111.0MB in the beginning and 73.5MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.41ms. Allocated memory is still 142.6MB. Free memory was 73.5MB in the beginning and 65.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 165.17ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 58.8MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1424.08ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 57.3MB in the end (delta: 1.5MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15639.74ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 56.0MB in the beginning and 177.2MB in the end (delta: -121.2MB). Peak memory consumption was 240.3MB. Max. memory is 16.1GB. * Witness Printer took 175.30ms. Allocated memory is still 503.3MB. Free memory was 177.2MB in the beginning and 449.5MB in the end (delta: -272.2MB). Peak memory consumption was 8.8MB. 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: 487]: 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: 776]: 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: 866]: 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: 915]: 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: 1032]: 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: 1081]: 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: 1157]: 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: 1336]: 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: 1385]: 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: 1461]: 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: 1599]: 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, 359 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3857 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3857 mSDsluCounter, 11572 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10464 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5324 IncrementalHoareTripleChecker+Invalid, 5330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 1108 mSDtfsCounter, 5324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1353 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=0, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 561 NumberOfCodeBlocks, 561 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 552 ConstructedInterpolants, 0 QuantifiedInterpolants, 12218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 21:22:54,656 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