./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.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.5.1.ufo.BOUNDED-10.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 ef1b718ec14fcc68d212ba49eb2094855200a064b5887a7f2eecdbae8074f363 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:22:43,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:22:43,123 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:43,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:22:43,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:22:43,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:22:43,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:22:43,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:22:43,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:22:43,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:22:43,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:22:43,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:22:43,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:22:43,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:22:43,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:22:43,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:22:43,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:43,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:22:43,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:22:43,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:22:43,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:22:43,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:22:43,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:22:43,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:22:43,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:22:43,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:22:43,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:22:43,151 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 -> ef1b718ec14fcc68d212ba49eb2094855200a064b5887a7f2eecdbae8074f363 [2025-02-07 21:22:43,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:22:43,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:22:43,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:22:43,393 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:22:43,393 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:22:43,395 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-02-07 21:22:44,559 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb75af520/68435daae83e4c2fbd80839518e560db/FLAG0e6fa33da [2025-02-07 21:22:44,911 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:22:44,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-02-07 21:22:44,925 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb75af520/68435daae83e4c2fbd80839518e560db/FLAG0e6fa33da [2025-02-07 21:22:44,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb75af520/68435daae83e4c2fbd80839518e560db [2025-02-07 21:22:44,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:22:44,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:22:44,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:44,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:22:44,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:22:44,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:44" (1/1) ... [2025-02-07 21:22:44,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35249644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:44, skipping insertion in model container [2025-02-07 21:22:44,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:44" (1/1) ... [2025-02-07 21:22:44,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:22:45,187 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11563,11576] [2025-02-07 21:22:45,204 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15640,15653] [2025-02-07 21:22:45,210 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16861,16874] [2025-02-07 21:22:45,216 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17567,17580] [2025-02-07 21:22:45,226 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19153,19166] [2025-02-07 21:22:45,228 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19859,19872] [2025-02-07 21:22:45,231 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20930,20943] [2025-02-07 21:22:45,239 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23420,23433] [2025-02-07 21:22:45,241 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24129,24142] [2025-02-07 21:22:45,244 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25166,25179] [2025-02-07 21:22:45,250 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27104,27117] [2025-02-07 21:22:45,262 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31138,31151] [2025-02-07 21:22:45,264 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31847,31860] [2025-02-07 21:22:45,267 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32921,32934] [2025-02-07 21:22:45,272 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34896,34909] [2025-02-07 21:22:45,283 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38277,38290] [2025-02-07 21:22:45,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:45,379 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:22:45,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[11563,11576] [2025-02-07 21:22:45,426 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[15640,15653] [2025-02-07 21:22:45,428 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[16861,16874] [2025-02-07 21:22:45,430 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[17567,17580] [2025-02-07 21:22:45,435 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19153,19166] [2025-02-07 21:22:45,437 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[19859,19872] [2025-02-07 21:22:45,440 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[20930,20943] [2025-02-07 21:22:45,445 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[23420,23433] [2025-02-07 21:22:45,449 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[24129,24142] [2025-02-07 21:22:45,451 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[25166,25179] [2025-02-07 21:22:45,455 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[27104,27117] [2025-02-07 21:22:45,462 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31138,31151] [2025-02-07 21:22:45,463 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[31847,31860] [2025-02-07 21:22:45,466 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[32921,32934] [2025-02-07 21:22:45,470 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[34896,34909] [2025-02-07 21:22:45,477 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.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c[38277,38290] [2025-02-07 21:22:45,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:45,553 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:22:45,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:45 WrapperNode [2025-02-07 21:22:45,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:45,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:45,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:22:45,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:22:45,560 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:45" (1/1) ... [2025-02-07 21:22:45,586 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:45" (1/1) ... [2025-02-07 21:22:45,684 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3758 [2025-02-07 21:22:45,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:45,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:22:45,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:22:45,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:22:45,691 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:45" (1/1) ... [2025-02-07 21:22:45,691 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:45" (1/1) ... [2025-02-07 21:22:45,697 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:45" (1/1) ... [2025-02-07 21:22:45,732 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:45,732 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:45" (1/1) ... [2025-02-07 21:22:45,732 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:45" (1/1) ... [2025-02-07 21:22:45,768 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:45" (1/1) ... [2025-02-07 21:22:45,775 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:45" (1/1) ... [2025-02-07 21:22:45,782 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:45" (1/1) ... [2025-02-07 21:22:45,790 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:45" (1/1) ... [2025-02-07 21:22:45,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:22:45,804 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:22:45,804 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:22:45,804 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:22:45,805 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:45" (1/1) ... [2025-02-07 21:22:45,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:45,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:22:45,831 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:45,833 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:45,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:22:45,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:22:45,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:22:45,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:22:45,999 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:22:46,000 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:22:47,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4991: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~49#1; [2025-02-07 21:22:47,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2151: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-07 21:22:47,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3539: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~33#1; [2025-02-07 21:22:47,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1690: havoc main_~check__tmp~13#1; [2025-02-07 21:22:47,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4597: havoc main_~node5____CPAchecker_TMP_0~10#1;havoc main_~node5__m5~26#1; [2025-02-07 21:22:47,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4399: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-07 21:22:47,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3145: havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node5__m5~18#1; [2025-02-07 21:22:47,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L437: havoc main_~node5__m5~1#1; [2025-02-07 21:22:47,586 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5195: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~51#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5063: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~50#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3743: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~35#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3611: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~34#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2026: havoc main_~node3__m3~4#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1168: havoc main_~node5__m5~4#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5132: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L772: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1763: havoc main_~node5__m5~8#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5661: havoc main_~node5____CPAchecker_TMP_0~16#1;havoc main_~node5__m5~32#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3680: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-02-07 21:22:47,587 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4209: havoc main_~node5____CPAchecker_TMP_0~8#1;havoc main_~node5__m5~24#1; [2025-02-07 21:22:47,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5267: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~52#1; [2025-02-07 21:22:47,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1898: havoc main_~check__tmp~16#1;havoc main_~node5__m5~9#1; [2025-02-07 21:22:47,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2625: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1; [2025-02-07 21:22:47,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2559: havoc main_~node3__m3~5#1; [2025-02-07 21:22:47,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1833: havoc main_~check__tmp~15#1; [2025-02-07 21:22:47,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3815: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~36#1; [2025-02-07 21:22:47,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2230: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-07 21:22:47,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1041: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-07 21:22:47,588 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L513: havoc main_~node2__m2~2#1; [2025-02-07 21:22:47,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1306: havoc main_~node5__m5~5#1; [2025-02-07 21:22:47,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2100: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-07 21:22:47,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4479: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~43#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1377: havoc main_~check__tmp~9#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L254: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1;#t~ret25#1 := main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node5____CPAchecker_TMP_0~1#1, main_~node5__m5~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_~main____CPAchecker_TMP_0~1#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_~node5__m5~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_~node5__m5~3#1, main_~node4__m4~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_~node5__m5~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node5__m5~5#1, main_~node4__m4~3#1, main_~node3__m3~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_~node5__m5~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node5__m5~7#1, main_~node4__m4~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node5__m5~8#1, main_~check__tmp~16#1, main_~node5__m5~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~node5__m5~10#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~check__tmp~20#1, main_~node5__m5~11#1, main_~node4__m4~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~21#1, main_~check__tmp~22#1, main_~node5__m5~12#1, main_~check__tmp~23#1, main_~node5__m5~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~24#1, main_~check__tmp~25#1, main_~node5__m5~14#1, main_~check__tmp~26#1, main_~node5__m5~15#1, main_~node4__m4~8#1, main_~check__tmp~27#1, main_~node5__m5~16#1, main_~node5__m5~17#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~28#1, main_~node5____CPAchecker_TMP_0~0#1, main_~node5__m5~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~29#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~30#1, main_~node5____CPAchecker_TMP_0~2#1, main_~node5__m5~18#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~31#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~32#1, main_~node5____CPAchecker_TMP_0~3#1, main_~node5__m5~19#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~33#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~34#1, main_~node5____CPAchecker_TMP_0~4#1, main_~node5__m5~20#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_~main____CPAchecker_TMP_0~10#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~35#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~36#1, main_~node5____CPAchecker_TMP_0~5#1, main_~node5__m5~21#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~37#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_29~0#1, main_~assert__arg~28#1, main_~check__tmp~38#1, main_~node5____CPAchecker_TMP_0~6#1, main_~node5__m5~22#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_30~0#1, main_~assert__arg~29#1, main_~check__tmp~39#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_31~0#1, main_~assert__arg~30#1, main_~check__tmp~40#1, main_~node5____CPAchecker_TMP_0~7#1, main_~node5__m5~23#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_32~0#1, main_~assert__arg~31#1, main_~check__tmp~41#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_33~0#1, main_~assert__arg~32#1, main_~check__tmp~42#1, main_~node5____CPAchecker_TMP_0~8#1, main_~node5__m5~24#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_~main____CPAchecker_TMP_0~18#1, main_~__tmp_34~0#1, main_~assert__arg~33#1, main_~check__tmp~43#1, main_~main____CPAchecker_TMP_0~19#1, main_~__tmp_35~0#1, main_~assert__arg~34#1, main_~check__tmp~44#1, main_~node5____CPAchecker_TMP_0~9#1, main_~node5__m5~25#1, main_~main____CPAchecker_TMP_0~20#1, main_~__tmp_36~0#1, main_~assert__arg~35#1, main_~check__tmp~45#1, main_~main____CPAchecker_TMP_0~21#1, main_~__tmp_37~0#1, main_~assert__arg~36#1, main_~check__tmp~46#1, main_~node5____CPAchecker_TMP_0~10#1, main_~node5__m5~26#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~22#1, main_~__tmp_38~0#1, main_~assert__arg~37#1, main_~check__tmp~47#1, main_~main____CPAchecker_TMP_0~23#1, main_~__tmp_39~0#1, main_~assert__arg~38#1, main_~check__tmp~48#1, main_~node5____CPAchecker_TMP_0~11#1, main_~node5__m5~27#1, main_~main____CPAchecker_TMP_0~24#1, main_~__tmp_40~0#1, main_~assert__arg~39#1, main_~check__tmp~49#1, main_~main____CPAchecker_TMP_0~25#1, main_~__tmp_41~0#1, main_~assert__arg~40#1, main_~check__tmp~50#1, main_~node5____CPAchecker_TMP_0~12#1, main_~node5__m5~28#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_~main____CPAchecker_TMP_0~26#1, main_~__tmp_42~0#1, main_~assert__arg~41#1, main_~check__tmp~51#1, main_~main____CPAchecker_TMP_0~27#1, main_~__tmp_43~0#1, main_~assert__arg~42#1, main_~check__tmp~52#1, main_~node5____CPAchecker_TMP_0~13#1, main_~node5__m5~29#1, main_~main____CPAchecker_TMP_0~28#1, main_~__tmp_44~0#1, main_~assert__arg~43#1, main_~check__tmp~53#1, main_~main____CPAchecker_TMP_0~29#1, main_~__tmp_45~0#1, main_~assert__arg~44#1, main_~check__tmp~54#1, main_~node5____CPAchecker_TMP_0~14#1, main_~node5__m5~30#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~30#1, main_~__tmp_46~0#1, main_~assert__arg~45#1, main_~check__tmp~55#1, main_~main____CPAchecker_TMP_0~31#1, main_~__tmp_47~0#1, main_~assert__arg~46#1, main_~check__tmp~56#1, main_~node5____CPAchecker_TMP_0~15#1, main_~node5__m5~31#1, main_~main____CPAchecker_TMP_0~32#1, main_~__tmp_48~0#1, main_~assert__arg~47#1, main_~check__tmp~57#1, main_~main____CPAchecker_TMP_0~33#1, main_~__tmp_49~0#1, main_~assert__arg~48#1, main_~check__tmp~58#1, main_~node5____CPAchecker_TMP_0~16#1, main_~node5__m5~32#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:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4416: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4945: havoc main_~node5____CPAchecker_TMP_0~12#1;havoc main_~node5__m5~28#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3493: havoc main_~node5____CPAchecker_TMP_0~4#1;havoc main_~node5__m5~20#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L322: havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1578: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4551: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~44#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2041: havoc main_~node4__m4~6#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2900: havoc main_~node5__m5~17#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5543: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~55#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3099: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~28#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4091: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~39#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L392: havoc main_~node2__m2~1#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2374: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~21#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5149: havoc main_~node5____CPAchecker_TMP_0~13#1;havoc main_~node5__m5~29#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5480: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3697: havoc main_~node5____CPAchecker_TMP_0~5#1;havoc main_~node5__m5~21#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2574: havoc main_~node4__m4~8#1; [2025-02-07 21:22:47,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4028: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5615: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~56#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L528: havoc main_~node3__m3~2#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1453: havoc main_~node3__m3~3#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2841: havoc main_~check__tmp~27#1;havoc main_~node5__m5~16#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4163: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~40#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L863: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4827: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~47#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1656: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3375: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~31#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L997: havoc main_~node5__m5~3#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4433: havoc main_~node5____CPAchecker_TMP_0~9#1;havoc main_~node5__m5~25#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4764: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-02-07 21:22:47,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1527: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5359: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~53#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1263: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056: havoc main_~node5__m5~10#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3312: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3907: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~37#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4899: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~48#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node3__m3~1#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2323: havoc main_~node4__m4~7#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3447: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~32#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2589: havoc main_~node5__m5~14#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5431: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~54#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5497: havoc main_~node5____CPAchecker_TMP_0~15#1;havoc main_~node5__m5~31#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2194: havoc main_~node5__m5~11#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L543: havoc main_~node4__m4~2#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468: havoc main_~node4__m4~4#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4045: havoc main_~node5____CPAchecker_TMP_0~7#1;havoc main_~node5__m5~23#1; [2025-02-07 21:22:47,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3979: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~38#1; [2025-02-07 21:22:47,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1799: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-07 21:22:47,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2724: havoc main_~check__tmp~26#1;havoc main_~node5__m5~15#1; [2025-02-07 21:22:47,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2659: havoc main_~check__tmp~25#1; [2025-02-07 21:22:47,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4643: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~45#1; [2025-02-07 21:22:47,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265: havoc main_~check__tmp~20#1; [2025-02-07 21:22:47,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3191: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~29#1; [2025-02-07 21:22:47,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1342: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-07 21:22:47,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L682: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:47,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4382: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1212: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L618: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L288: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L949: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L817: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4715: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~46#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4781: havoc main_~node5____CPAchecker_TMP_0~11#1;havoc main_~node5__m5~27#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5707: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~57#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L422: havoc main_~node4__m4~1#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2338: havoc main_~node5__m5~12#1; [2025-02-07 21:22:47,597 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3329: havoc main_~node5____CPAchecker_TMP_0~3#1;havoc main_~node5__m5~19#1; [2025-02-07 21:22:47,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3263: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~30#1; [2025-02-07 21:22:47,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2801: havoc main_~node4__m4~9#1; [2025-02-07 21:22:47,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4255: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~41#1; [2025-02-07 21:22:47,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5313: havoc main_~node5____CPAchecker_TMP_0~14#1;havoc main_~node5__m5~30#1; [2025-02-07 21:22:47,598 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5115: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2011: havoc main_~node2__m2~3#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3861: havoc main_~node5____CPAchecker_TMP_0~6#1;havoc main_~node5__m5~22#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L558: havoc main_~node5__m5~2#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3663: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1483: havoc main_~node5__m5~6#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2474: havoc main_~check__tmp~23#1;havoc main_~node5__m5~13#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1153: havoc main_~node4__m4~3#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1748: havoc main_~node4__m4~5#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2409: havoc main_~check__tmp~22#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L5779: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~58#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L4327: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~42#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1620: havoc main_~node5__m5~7#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L497: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-07 21:22:47,599 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1092: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-07 21:22:47,724 INFO L? ?]: Removed 982 outVars from TransFormulas that were not future-live. [2025-02-07 21:22:47,724 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:22:47,747 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:22:47,747 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:22:47,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:47 BoogieIcfgContainer [2025-02-07 21:22:47,747 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:22:47,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:22:47,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:22:47,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:22:47,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:22:44" (1/3) ... [2025-02-07 21:22:47,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174aa96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:22:47, skipping insertion in model container [2025-02-07 21:22:47,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:45" (2/3) ... [2025-02-07 21:22:47,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@174aa96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:22:47, skipping insertion in model container [2025-02-07 21:22:47,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:47" (3/3) ... [2025-02-07 21:22:47,759 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c [2025-02-07 21:22:47,772 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:22:47,775 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c.v+lhb-reducer.c that has 1 procedures, 630 locations, 1 initial locations, 0 loop locations, and 16 error locations. [2025-02-07 21:22:47,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:22:47,850 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;@6516c679, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:22:47,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-07 21:22:47,857 INFO L276 IsEmpty]: Start isEmpty. Operand has 629 states, 520 states have (on average 1.998076923076923) internal successors, (1039), 628 states have internal predecessors, (1039), 0 states have call successors, (0), 0 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,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:22:47,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:47,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:47,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:22:47,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:47,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1994619948, now seen corresponding path program 1 times [2025-02-07 21:22:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:47,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128813442] [2025-02-07 21:22:47,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:47,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:22:48,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:22:48,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:48,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:49,219 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,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:49,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128813442] [2025-02-07 21:22:49,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128813442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:49,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:49,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:22:49,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394597829] [2025-02-07 21:22:49,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:49,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:22:49,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:49,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:22:49,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:22:49,247 INFO L87 Difference]: Start difference. First operand has 629 states, 520 states have (on average 1.998076923076923) internal successors, (1039), 628 states have internal predecessors, (1039), 0 states have call successors, (0), 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 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:49,932 INFO L93 Difference]: Finished difference Result 647 states and 1039 transitions. [2025-02-07 21:22:49,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:22:49,936 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-07 21:22:49,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:49,944 INFO L225 Difference]: With dead ends: 647 [2025-02-07 21:22:49,945 INFO L226 Difference]: Without dead ends: 202 [2025-02-07 21:22:49,949 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:49,954 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 4374 mSDsluCounter, 3281 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4374 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:49,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4374 Valid, 4155 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:22:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-07 21:22:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-02-07 21:22:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 190 states have (on average 1.0578947368421052) internal successors, (201), 201 states have internal predecessors, (201), 0 states have call successors, (0), 0 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:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 201 transitions. [2025-02-07 21:22:49,990 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 201 transitions. Word has length 75 [2025-02-07 21:22:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:49,991 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 201 transitions. [2025-02-07 21:22:49,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 201 transitions. [2025-02-07 21:22:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:22:49,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:49,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:49,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:22:49,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:22:49,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:49,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1910263825, now seen corresponding path program 1 times [2025-02-07 21:22:49,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:49,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212797097] [2025-02-07 21:22:49,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:49,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:50,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:22:50,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:22:50,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:50,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:50,981 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,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:50,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212797097] [2025-02-07 21:22:50,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212797097] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:50,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:50,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-07 21:22:50,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761955983] [2025-02-07 21:22:50,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:50,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 21:22:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:50,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 21:22:50,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-02-07 21:22:50,984 INFO L87 Difference]: Start difference. First operand 202 states and 201 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:51,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:51,873 INFO L93 Difference]: Finished difference Result 202 states and 201 transitions. [2025-02-07 21:22:51,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 21:22:51,874 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-07 21:22:51,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:51,875 INFO L225 Difference]: With dead ends: 202 [2025-02-07 21:22:51,875 INFO L226 Difference]: Without dead ends: 197 [2025-02-07 21:22:51,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2025-02-07 21:22:51,877 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 913 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:51,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1235 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:22:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-07 21:22:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-02-07 21:22:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 186 states have (on average 1.053763440860215) internal successors, (196), 196 states have internal predecessors, (196), 0 states have call successors, (0), 0 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,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 196 transitions. [2025-02-07 21:22:51,883 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 196 transitions. Word has length 75 [2025-02-07 21:22:51,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:51,884 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 196 transitions. [2025-02-07 21:22:51,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 15 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 196 transitions. [2025-02-07 21:22:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:22:51,885 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:51,885 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:51,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:22:51,886 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:22:51,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:51,886 INFO L85 PathProgramCache]: Analyzing trace with hash -90528527, now seen corresponding path program 1 times [2025-02-07 21:22:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:51,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608130617] [2025-02-07 21:22:51,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:51,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:22:51,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:22:51,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:51,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:53,501 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,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:53,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608130617] [2025-02-07 21:22:53,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608130617] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:53,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:53,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2025-02-07 21:22:53,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96904407] [2025-02-07 21:22:53,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:53,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 21:22:53,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:53,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 21:22:53,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=745, Unknown=0, NotChecked=0, Total=812 [2025-02-07 21:22:53,504 INFO L87 Difference]: Start difference. First operand 197 states and 196 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 28 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:55,456 INFO L93 Difference]: Finished difference Result 197 states and 196 transitions. [2025-02-07 21:22:55,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-07 21:22:55,457 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 28 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-07 21:22:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:55,458 INFO L225 Difference]: With dead ends: 197 [2025-02-07 21:22:55,458 INFO L226 Difference]: Without dead ends: 189 [2025-02-07 21:22:55,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=350, Invalid=2302, Unknown=0, NotChecked=0, Total=2652 [2025-02-07 21:22:55,460 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 398 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 2501 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:55,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 2501 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-07 21:22:55,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-02-07 21:22:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-02-07 21:22:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 179 states have (on average 1.0502793296089385) internal successors, (188), 188 states have internal predecessors, (188), 0 states have call successors, (0), 0 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:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 188 transitions. [2025-02-07 21:22:55,466 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 188 transitions. Word has length 75 [2025-02-07 21:22:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:55,469 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 188 transitions. [2025-02-07 21:22:55,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 28 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 188 transitions. [2025-02-07 21:22:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:22:55,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:55,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:55,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:22:55,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:22:55,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:55,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1713338733, now seen corresponding path program 1 times [2025-02-07 21:22:55,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:55,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846399770] [2025-02-07 21:22:55,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:55,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:22:55,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:22:55,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:55,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:55,930 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:55,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:55,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846399770] [2025-02-07 21:22:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846399770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:55,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:55,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 21:22:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748936085] [2025-02-07 21:22:55,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:55,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:22:55,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:55,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:22:55,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:22:55,931 INFO L87 Difference]: Start difference. First operand 189 states and 188 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:56,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:56,330 INFO L93 Difference]: Finished difference Result 189 states and 188 transitions. [2025-02-07 21:22:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:22:56,330 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-07 21:22:56,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:56,332 INFO L225 Difference]: With dead ends: 189 [2025-02-07 21:22:56,332 INFO L226 Difference]: Without dead ends: 184 [2025-02-07 21:22:56,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:22:56,333 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 593 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:56,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 753 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:22:56,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-07 21:22:56,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-07 21:22:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 175 states have (on average 1.0457142857142858) internal successors, (183), 183 states have internal predecessors, (183), 0 states have call successors, (0), 0 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:56,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 183 transitions. [2025-02-07 21:22:56,339 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 183 transitions. Word has length 75 [2025-02-07 21:22:56,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:56,339 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 183 transitions. [2025-02-07 21:22:56,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 11 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 183 transitions. [2025-02-07 21:22:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:22:56,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:56,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:56,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:22:56,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:22:56,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:56,345 INFO L85 PathProgramCache]: Analyzing trace with hash -760666407, now seen corresponding path program 1 times [2025-02-07 21:22:56,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:56,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757514397] [2025-02-07 21:22:56,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:56,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:22:56,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:22:56,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:56,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:56,773 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:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:56,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757514397] [2025-02-07 21:22:56,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757514397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:56,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:56,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:22:56,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318677746] [2025-02-07 21:22:56,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:56,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:22:56,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:56,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:22:56,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:22:56,775 INFO L87 Difference]: Start difference. First operand 184 states and 183 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:57,113 INFO L93 Difference]: Finished difference Result 184 states and 183 transitions. [2025-02-07 21:22:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:22:57,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-07 21:22:57,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:57,115 INFO L225 Difference]: With dead ends: 184 [2025-02-07 21:22:57,115 INFO L226 Difference]: Without dead ends: 170 [2025-02-07 21:22:57,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:57,115 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 299 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:57,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 1116 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:22:57,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-07 21:22:57,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-02-07 21:22:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 162 states have (on average 1.0432098765432098) internal successors, (169), 169 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 169 transitions. [2025-02-07 21:22:57,119 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 169 transitions. Word has length 75 [2025-02-07 21:22:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:57,120 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 169 transitions. [2025-02-07 21:22:57,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 169 transitions. [2025-02-07 21:22:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 21:22:57,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:57,120 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:57,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:22:57,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:22:57,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:57,121 INFO L85 PathProgramCache]: Analyzing trace with hash 138379918, now seen corresponding path program 1 times [2025-02-07 21:22:57,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:57,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734445898] [2025-02-07 21:22:57,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:57,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:57,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 21:22:57,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 21:22:57,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:57,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:57,501 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:57,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:57,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734445898] [2025-02-07 21:22:57,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734445898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:57,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:57,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-07 21:22:57,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017737077] [2025-02-07 21:22:57,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:57,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 21:22:57,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:57,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 21:22:57,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-07 21:22:57,503 INFO L87 Difference]: Start difference. First operand 170 states and 169 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:57,694 INFO L93 Difference]: Finished difference Result 170 states and 169 transitions. [2025-02-07 21:22:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 21:22:57,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-02-07 21:22:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:57,695 INFO L225 Difference]: With dead ends: 170 [2025-02-07 21:22:57,695 INFO L226 Difference]: Without dead ends: 127 [2025-02-07 21:22:57,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-02-07 21:22:57,696 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 313 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:57,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 416 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:22:57,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-07 21:22:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-07 21:22:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 123 states have (on average 1.024390243902439) internal successors, (126), 126 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 126 transitions. [2025-02-07 21:22:57,699 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 126 transitions. Word has length 75 [2025-02-07 21:22:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:57,699 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 126 transitions. [2025-02-07 21:22:57,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 9 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:22:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 126 transitions. [2025-02-07 21:22:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 21:22:57,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:57,700 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] [2025-02-07 21:22:57,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:22:57,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:22:57,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:57,700 INFO L85 PathProgramCache]: Analyzing trace with hash 438952148, now seen corresponding path program 1 times [2025-02-07 21:22:57,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:57,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639130180] [2025-02-07 21:22:57,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:57,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:57,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 21:22:57,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 21:22:57,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:57,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:58,957 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:58,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:58,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639130180] [2025-02-07 21:22:58,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639130180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:58,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:58,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:22:58,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409049227] [2025-02-07 21:22:58,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:58,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-07 21:22:58,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:58,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-07 21:22:58,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2025-02-07 21:22:58,958 INFO L87 Difference]: Start difference. First operand 127 states and 126 transitions. Second operand has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:23:00,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:00,250 INFO L93 Difference]: Finished difference Result 127 states and 126 transitions. [2025-02-07 21:23:00,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-07 21:23:00,252 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 21:23:00,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:00,252 INFO L225 Difference]: With dead ends: 127 [2025-02-07 21:23:00,252 INFO L226 Difference]: Without dead ends: 114 [2025-02-07 21:23:00,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=355, Invalid=2195, Unknown=0, NotChecked=0, Total=2550 [2025-02-07 21:23:00,253 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 527 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1279 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:00,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1279 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 21:23:00,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-07 21:23:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-07 21:23:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 111 states have (on average 1.018018018018018) internal successors, (113), 113 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 21:23:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 113 transitions. [2025-02-07 21:23:00,261 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 113 transitions. Word has length 76 [2025-02-07 21:23:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:00,261 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 113 transitions. [2025-02-07 21:23:00,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:23:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 113 transitions. [2025-02-07 21:23:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 21:23:00,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:00,262 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] [2025-02-07 21:23:00,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:23:00,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:00,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1101481696, now seen corresponding path program 1 times [2025-02-07 21:23:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:00,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213907752] [2025-02-07 21:23:00,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:00,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:00,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 21:23:00,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 21:23:00,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:00,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:01,302 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:23:01,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:01,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213907752] [2025-02-07 21:23:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213907752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:01,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:01,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-02-07 21:23:01,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203370982] [2025-02-07 21:23:01,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:01,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 21:23:01,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:01,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 21:23:01,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2025-02-07 21:23:01,304 INFO L87 Difference]: Start difference. First operand 114 states and 113 transitions. Second operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:23:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:02,407 INFO L93 Difference]: Finished difference Result 114 states and 113 transitions. [2025-02-07 21:23:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-07 21:23:02,407 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 21:23:02,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:02,408 INFO L225 Difference]: With dead ends: 114 [2025-02-07 21:23:02,408 INFO L226 Difference]: Without dead ends: 104 [2025-02-07 21:23:02,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=318, Invalid=2034, Unknown=0, NotChecked=0, Total=2352 [2025-02-07 21:23:02,409 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 355 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:02,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1031 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 21:23:02,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-07 21:23:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-07 21:23:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 103 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:23:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 103 transitions. [2025-02-07 21:23:02,411 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 103 transitions. Word has length 76 [2025-02-07 21:23:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:02,411 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 103 transitions. [2025-02-07 21:23:02,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 27 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:23:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 103 transitions. [2025-02-07 21:23:02,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-07 21:23:02,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:02,412 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] [2025-02-07 21:23:02,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:23:02,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:02,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:02,412 INFO L85 PathProgramCache]: Analyzing trace with hash 657484254, now seen corresponding path program 1 times [2025-02-07 21:23:02,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:02,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185651770] [2025-02-07 21:23:02,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:02,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:02,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-07 21:23:02,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-07 21:23:02,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:02,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:02,709 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:23:02,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:02,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185651770] [2025-02-07 21:23:02,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185651770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:02,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:02,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-07 21:23:02,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191278167] [2025-02-07 21:23:02,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:02,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 21:23:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:02,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 21:23:02,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:23:02,710 INFO L87 Difference]: Start difference. First operand 104 states and 103 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:23:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:02,950 INFO L93 Difference]: Finished difference Result 104 states and 103 transitions. [2025-02-07 21:23:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 21:23:02,951 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-02-07 21:23:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:02,951 INFO L225 Difference]: With dead ends: 104 [2025-02-07 21:23:02,951 INFO L226 Difference]: Without dead ends: 97 [2025-02-07 21:23:02,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-07 21:23:02,952 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 255 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:02,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 374 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:23:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-07 21:23:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-07 21:23:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.0) internal successors, (96), 96 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:23:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 96 transitions. [2025-02-07 21:23:02,954 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 96 transitions. Word has length 76 [2025-02-07 21:23:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:02,954 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 96 transitions. [2025-02-07 21:23:02,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 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:23:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 96 transitions. [2025-02-07 21:23:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-07 21:23:02,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:23:02,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:02,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 21:23:02,955 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2025-02-07 21:23:02,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:23:02,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1892328298, now seen corresponding path program 1 times [2025-02-07 21:23:02,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:23:02,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271649499] [2025-02-07 21:23:02,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:23:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:23:02,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-07 21:23:02,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-07 21:23:02,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:23:02,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:23:02,994 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:23:02,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:23:02,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271649499] [2025-02-07 21:23:02,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271649499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:23:02,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:23:02,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:23:02,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067191421] [2025-02-07 21:23:02,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:23:02,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:23:02,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:23:02,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:23:02,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:23:02,995 INFO L87 Difference]: Start difference. First operand 97 states and 96 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:23:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:23:03,005 INFO L93 Difference]: Finished difference Result 97 states and 96 transitions. [2025-02-07 21:23:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:23:03,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-02-07 21:23:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:23:03,006 INFO L225 Difference]: With dead ends: 97 [2025-02-07 21:23:03,006 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:23:03,006 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:23:03,007 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:23:03,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:23:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:23:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:23:03,007 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:23:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:23:03,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2025-02-07 21:23:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:23:03,008 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:23:03,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:23:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:23:03,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:23:03,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 16 remaining) [2025-02-07 21:23:03,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (14 of 16 remaining) [2025-02-07 21:23:03,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 16 remaining) [2025-02-07 21:23:03,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (12 of 16 remaining) [2025-02-07 21:23:03,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (11 of 16 remaining) [2025-02-07 21:23:03,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (10 of 16 remaining) [2025-02-07 21:23:03,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (9 of 16 remaining) [2025-02-07 21:23:03,010 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (8 of 16 remaining) [2025-02-07 21:23:03,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (7 of 16 remaining) [2025-02-07 21:23:03,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (6 of 16 remaining) [2025-02-07 21:23:03,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (5 of 16 remaining) [2025-02-07 21:23:03,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (4 of 16 remaining) [2025-02-07 21:23:03,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (3 of 16 remaining) [2025-02-07 21:23:03,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (2 of 16 remaining) [2025-02-07 21:23:03,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (1 of 16 remaining) [2025-02-07 21:23:03,011 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (0 of 16 remaining) [2025-02-07 21:23:03,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-07 21:23:03,013 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:23:03,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:23:03,018 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:23:03,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:23:03 BoogieIcfgContainer [2025-02-07 21:23:03,023 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:23:03,023 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:23:03,023 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:23:03,023 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:23:03,023 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:47" (3/4) ... [2025-02-07 21:23:03,025 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:23:03,050 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:23:03,053 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:23:03,056 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 21:23:03,058 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:23:03,222 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:23:03,222 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:23:03,223 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:23:03,224 INFO L158 Benchmark]: Toolchain (without parser) took 18281.21ms. Allocated memory was 142.6MB in the beginning and 704.6MB in the end (delta: 562.0MB). Free memory was 108.1MB in the beginning and 559.7MB in the end (delta: -451.5MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. [2025-02-07 21:23:03,224 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:23:03,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 612.15ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 46.6MB in the end (delta: 61.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-07 21:23:03,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.39ms. Allocated memory is still 142.6MB. Free memory was 46.6MB in the beginning and 99.0MB in the end (delta: -52.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2025-02-07 21:23:03,225 INFO L158 Benchmark]: Boogie Preprocessor took 117.72ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 86.5MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:23:03,225 INFO L158 Benchmark]: IcfgBuilder took 1943.95ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 86.5MB in the beginning and 166.1MB in the end (delta: -79.6MB). Peak memory consumption was 181.2MB. Max. memory is 16.1GB. [2025-02-07 21:23:03,225 INFO L158 Benchmark]: TraceAbstraction took 15271.33ms. Allocated memory was 402.7MB in the beginning and 704.6MB in the end (delta: 302.0MB). Free memory was 165.2MB in the beginning and 597.4MB in the end (delta: -432.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:23:03,226 INFO L158 Benchmark]: Witness Printer took 199.62ms. Allocated memory is still 704.6MB. Free memory was 597.4MB in the beginning and 559.7MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-07 21:23:03,228 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.50ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 612.15ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 46.6MB in the end (delta: 61.0MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.39ms. Allocated memory is still 142.6MB. Free memory was 46.6MB in the beginning and 99.0MB in the end (delta: -52.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 117.72ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 86.5MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1943.95ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 86.5MB in the beginning and 166.1MB in the end (delta: -79.6MB). Peak memory consumption was 181.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15271.33ms. Allocated memory was 402.7MB in the beginning and 704.6MB in the end (delta: 302.0MB). Free memory was 165.2MB in the beginning and 597.4MB in the end (delta: -432.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 199.62ms. Allocated memory is still 704.6MB. Free memory was 597.4MB in the beginning and 559.7MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 614]: 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: 956]: 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: 1048]: 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: 1099]: 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: 1219]: 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: 1270]: 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: 1349]: 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: 1534]: 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: 1585]: 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: 1663]: 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: 1806]: 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: 2107]: 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: 2158]: 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: 2237]: 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: 2381]: 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: 2632]: 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, 630 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8027 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8027 mSDsluCounter, 13037 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11190 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5424 IncrementalHoareTripleChecker+Invalid, 5455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 1847 mSDtfsCounter, 5424 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 282 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=629occurred in iteration=0, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 764 ConstructedInterpolants, 0 QuantifiedInterpolants, 17861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 21:23:03,245 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