./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 387ead5fcaba90caf6c9be83f63993a555a04df2a6fb080e5353f6595f8a626c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:22:57,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:22:57,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:22:57,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:22:57,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:22:57,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:22:57,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:22:57,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:22:57,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:22:57,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:22:57,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:22:57,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:22:57,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:22:57,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:22:57,837 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:22:57,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:22:57,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:22:57,837 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:22:57,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:22:57,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:22:57,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:22:57,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:22:57,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:22:57,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:22:57,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:22:57,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:22:57,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:22:57,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:22:57,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:22:57,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:22:57,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:22:57,840 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/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 -> 387ead5fcaba90caf6c9be83f63993a555a04df2a6fb080e5353f6595f8a626c [2025-03-16 19:22:58,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:22:58,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:22:58,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:22:58,093 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:22:58,093 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:22:58,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-16 19:22:59,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb6dd43f/39bf89a7b7cf4476a65408470b88bbd2/FLAG505ba4e0a [2025-03-16 19:22:59,674 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:22:59,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-16 19:22:59,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb6dd43f/39bf89a7b7cf4476a65408470b88bbd2/FLAG505ba4e0a [2025-03-16 19:22:59,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb6dd43f/39bf89a7b7cf4476a65408470b88bbd2 [2025-03-16 19:22:59,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:22:59,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:22:59,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:22:59,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:22:59,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:22:59,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:22:59" (1/1) ... [2025-03-16 19:22:59,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e8f30d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:22:59, skipping insertion in model container [2025-03-16 19:22:59,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:22:59" (1/1) ... [2025-03-16 19:22:59,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:23:00,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[50116,50129] [2025-03-16 19:23:00,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:23:00,632 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:23:00,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[50116,50129] [2025-03-16 19:23:00,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:23:01,009 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:23:01,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:01 WrapperNode [2025-03-16 19:23:01,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:23:01,012 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:23:01,012 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:23:01,012 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:23:01,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:01" (1/1) ... [2025-03-16 19:23:01,050 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:01" (1/1) ... [2025-03-16 19:23:01,155 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4993 [2025-03-16 19:23:01,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:23:01,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:23:01,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:23:01,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:23:01,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:01" (1/1) ... [2025-03-16 19:23:01,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:01" (1/1) ... [2025-03-16 19:23:01,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:01" (1/1) ... [2025-03-16 19:23:01,258 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor has thrown an exception: java.lang.StackOverflowError at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processExpression(BoogieTransformer.java:690) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processExpression(BoogieTransformer.java:693) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processExpression(BoogieTransformer.java:693) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processExpression(BoogieTransformer.java:693) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processExpression(BoogieTransformer.java:693) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processExpression(BoogieTransformer.java:694) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:406) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:410) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) at de.uni_freiburg.informatik.ultimate.boogie.preprocessor.memoryslicer.MemoryArrayReplacer.processStatement(MemoryArrayReplacer.java:239) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatements(BoogieTransformer.java:342) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processStatement(BoogieTransformer.java:408) [2025-03-16 19:23:01,296 INFO L158 Benchmark]: Toolchain (without parser) took 1387.04ms. Allocated memory is still 201.3MB. Free memory was 149.1MB in the beginning and 132.5MB in the end (delta: 16.6MB). Peak memory consumption was 128.3MB. Max. memory is 16.1GB. [2025-03-16 19:23:01,296 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 19:23:01,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1105.61ms. Allocated memory is still 201.3MB. Free memory was 148.9MB in the beginning and 74.8MB in the end (delta: 74.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2025-03-16 19:23:01,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.83ms. Allocated memory is still 201.3MB. Free memory was 74.8MB in the beginning and 51.3MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 19:23:01,296 INFO L158 Benchmark]: Boogie Preprocessor took 134.97ms. Allocated memory is still 201.3MB. Free memory was 51.3MB in the beginning and 132.5MB in the end (delta: -81.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2025-03-16 19:23:01,297 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1105.61ms. Allocated memory is still 201.3MB. Free memory was 148.9MB in the beginning and 74.8MB in the end (delta: 74.2MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.83ms. Allocated memory is still 201.3MB. Free memory was 74.8MB in the beginning and 51.3MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.97ms. Allocated memory is still 201.3MB. Free memory was 51.3MB in the beginning and 132.5MB in the end (delta: -81.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - ExceptionOrErrorResult: StackOverflowError: null de.uni_freiburg.informatik.ultimate.boogie.preprocessor: StackOverflowError: null: de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processExpression(BoogieTransformer.java:690) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 387ead5fcaba90caf6c9be83f63993a555a04df2a6fb080e5353f6595f8a626c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:23:03,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:23:03,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 19:23:03,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:23:03,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:23:03,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:23:03,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:23:03,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:23:03,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:23:03,190 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:23:03,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:23:03,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:23:03,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:23:03,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:23:03,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:23:03,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:23:03,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:23:03,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:23:03,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:23:03,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:23:03,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:23:03,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:23:03,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:23:03,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:23:03,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:23:03,193 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 19:23:03,193 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 19:23:03,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:23:03,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:23:03,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:23:03,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:23:03,194 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/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 -> 387ead5fcaba90caf6c9be83f63993a555a04df2a6fb080e5353f6595f8a626c [2025-03-16 19:23:03,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:23:03,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:23:03,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:23:03,453 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:23:03,453 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:23:03,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-16 19:23:04,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6b761a8/721873dc19994203afe9814c02d536f4/FLAG87999227a [2025-03-16 19:23:05,030 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:23:05,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-16 19:23:05,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6b761a8/721873dc19994203afe9814c02d536f4/FLAG87999227a [2025-03-16 19:23:05,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec6b761a8/721873dc19994203afe9814c02d536f4 [2025-03-16 19:23:05,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:23:05,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:23:05,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:23:05,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:23:05,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:23:05,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:23:05" (1/1) ... [2025-03-16 19:23:05,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60acc10b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:05, skipping insertion in model container [2025-03-16 19:23:05,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:23:05" (1/1) ... [2025-03-16 19:23:05,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:23:05,840 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[50116,50129] [2025-03-16 19:23:06,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:23:06,027 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:23:06,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[50116,50129] [2025-03-16 19:23:06,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:23:06,366 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:23:06,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06 WrapperNode [2025-03-16 19:23:06,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:23:06,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:23:06,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:23:06,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:23:06,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,501 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 4963 [2025-03-16 19:23:06,501 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:23:06,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:23:06,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:23:06,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:23:06,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,551 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-03-16 19:23:06,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:23:06,648 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:23:06,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:23:06,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:23:06,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:23:06,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:06,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:23:06,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:23:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:23:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 19:23:06,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:23:06,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:23:06,896 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:23:06,897 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:23:09,605 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3698: havoc main_~node3____CPAchecker_TMP_3~3#1;havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-16 19:23:09,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3344: havoc main_~node5____CPAchecker_TMP_3~3#1;havoc main_~node5____CPAchecker_TMP_2~3#1;havoc main_~node5____CPAchecker_TMP_1~3#1;havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-03-16 19:23:09,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3875: havoc main_~node2____CPAchecker_TMP_3~3#1;havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-16 19:23:09,606 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2859: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node5____CPAchecker_TMP_3~2#1;havoc main_~node5____CPAchecker_TMP_2~2#1;havoc main_~node5____CPAchecker_TMP_1~2#1;havoc main_~node5____CPAchecker_TMP_0~2#1;havoc main_~node4____CPAchecker_TMP_3~2#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node3____CPAchecker_TMP_3~2#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node2____CPAchecker_TMP_3~2#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node1____CPAchecker_TMP_3~2#1;havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;havoc main_~node5____CPAchecker_TMP_3~1#1;havoc main_~node5____CPAchecker_TMP_2~1#1;havoc main_~node5____CPAchecker_TMP_1~1#1;havoc main_~node5____CPAchecker_TMP_0~1#1;havoc main_~node4____CPAchecker_TMP_3~1#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node3____CPAchecker_TMP_3~1#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node2____CPAchecker_TMP_3~1#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node1____CPAchecker_TMP_3~1#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_3~0#1;havoc main_~node5____CPAchecker_TMP_2~0#1;havoc main_~node5____CPAchecker_TMP_1~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node4____CPAchecker_TMP_3~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node3____CPAchecker_TMP_3~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node2____CPAchecker_TMP_3~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node1____CPAchecker_TMP_3~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r151~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r251~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r351~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r451~0#1, main_~init__r511~0#1, main_~init__r521~0#1, main_~init__r531~0#1, main_~init__r541~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r152~0#1, main_~init__tmp___2~0#1, main_~init__r212~0#1, main_~init__tmp___3~0#1, main_~init__r232~0#1, main_~init__tmp___4~0#1, main_~init__r242~0#1, main_~init__tmp___5~0#1, main_~init__r252~0#1, main_~init__tmp___6~0#1, main_~init__r312~0#1, main_~init__tmp___7~0#1, main_~init__r322~0#1, main_~init__tmp___8~0#1, main_~init__r342~0#1, main_~init__tmp___9~0#1, main_~init__r352~0#1, main_~init__tmp___10~0#1, main_~init__r412~0#1, main_~init__tmp___11~0#1, main_~init__r422~0#1, main_~init__tmp___12~0#1, main_~init__r432~0#1, main_~init__tmp___13~0#1, main_~init__r452~0#1, main_~init__tmp___14~0#1, main_~init__r512~0#1, main_~init__tmp___15~0#1, main_~init__r522~0#1, main_~init__tmp___16~0#1, main_~init__r532~0#1, main_~init__tmp___17~0#1, main_~init__r542~0#1, main_~init__tmp___18~0#1, main_~init__r123~0#1, main_~init__tmp___19~0#1, main_~init__r133~0#1, main_~init__tmp___20~0#1, main_~init__r143~0#1, main_~init__tmp___21~0#1, main_~init__r153~0#1, main_~init__tmp___22~0#1, main_~init__r213~0#1, main_~init__tmp___23~0#1, main_~init__r233~0#1, main_~init__tmp___24~0#1, main_~init__r243~0#1, main_~init__tmp___25~0#1, main_~init__r253~0#1, main_~init__tmp___26~0#1, main_~init__r313~0#1, main_~init__tmp___27~0#1, main_~init__r323~0#1, main_~init__tmp___28~0#1, main_~init__r343~0#1, main_~init__tmp___29~0#1, main_~init__r353~0#1, main_~init__tmp___30~0#1, main_~init__r413~0#1, main_~init__tmp___31~0#1, main_~init__r423~0#1, main_~init__tmp___32~0#1, main_~init__r433~0#1, main_~init__tmp___33~0#1, main_~init__r453~0#1, main_~init__tmp___34~0#1, main_~init__r513~0#1, main_~init__tmp___35~0#1, main_~init__r523~0#1, main_~init__tmp___36~0#1, main_~init__r533~0#1, main_~init__tmp___37~0#1, main_~init__r543~0#1, main_~init__tmp___38~0#1, main_~init__r124~0#1, main_~init__tmp___39~0#1, main_~init__r134~0#1, main_~init__tmp___40~0#1, main_~init__r144~0#1, main_~init__tmp___41~0#1, main_~init__r154~0#1, main_~init__tmp___42~0#1, main_~init__r214~0#1, main_~init__tmp___43~0#1, main_~init__r234~0#1, main_~init__tmp___44~0#1, main_~init__r244~0#1, main_~init__tmp___45~0#1, main_~init__r254~0#1, main_~init__tmp___46~0#1, main_~init__r314~0#1, main_~init__tmp___47~0#1, main_~init__r324~0#1, main_~init__tmp___48~0#1, main_~init__r344~0#1, main_~init__tmp___49~0#1, main_~init__r354~0#1, main_~init__tmp___50~0#1, main_~init__r414~0#1, main_~init__tmp___51~0#1, main_~init__r424~0#1, main_~init__tmp___52~0#1, main_~init__r434~0#1, main_~init__tmp___53~0#1, main_~init__r454~0#1, main_~init__tmp___54~0#1, main_~init__r514~0#1, main_~init__tmp___55~0#1, main_~init__r524~0#1, main_~init__tmp___56~0#1, main_~init__r534~0#1, main_~init__tmp___57~0#1, main_~init__r544~0#1, main_~init__tmp___58~0#1, main_~init__tmp___59~0#1; [2025-03-16 19:23:09,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3124: havoc main_~check__tmp~6#1; [2025-03-16 19:23:09,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3521: havoc main_~node4____CPAchecker_TMP_3~3#1;havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-16 19:23:09,607 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4052: havoc main_~node1____CPAchecker_TMP_3~3#1;havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-16 19:23:10,038 INFO L? ?]: Removed 350 outVars from TransFormulas that were not future-live. [2025-03-16 19:23:10,038 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:23:10,062 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:23:10,062 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:23:10,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:23:10 BoogieIcfgContainer [2025-03-16 19:23:10,062 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:23:10,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:23:10,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:23:10,072 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:23:10,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:23:05" (1/3) ... [2025-03-16 19:23:10,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6053c2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:23:10, skipping insertion in model container [2025-03-16 19:23:10,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (2/3) ... [2025-03-16 19:23:10,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6053c2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:23:10, skipping insertion in model container [2025-03-16 19:23:10,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:23:10" (3/3) ... [2025-03-16 19:23:10,073 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-16 19:23:10,083 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:23:10,086 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 1316 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:23:10,171 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:23:10,181 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;@65fd19d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:23:10,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:23:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 1316 states, 1314 states have (on average 1.8074581430745815) internal successors, (2375), 1315 states have internal predecessors, (2375), 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-03-16 19:23:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2025-03-16 19:23:10,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:10,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:10,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:10,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash 247398523, now seen corresponding path program 1 times [2025-03-16 19:23:10,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:10,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [698087166] [2025-03-16 19:23:10,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:10,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:10,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:10,242 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:10,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:23:10,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 462 statements into 1 equivalence classes. [2025-03-16 19:23:10,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 462 of 462 statements. [2025-03-16 19:23:10,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:10,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:10,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:23:10,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:11,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:11,189 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:11,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698087166] [2025-03-16 19:23:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698087166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:11,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:11,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219831945] [2025-03-16 19:23:11,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:11,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:11,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:11,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:11,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:11,217 INFO L87 Difference]: Start difference. First operand has 1316 states, 1314 states have (on average 1.8074581430745815) internal successors, (2375), 1315 states have internal predecessors, (2375), 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 4 states, 4 states have (on average 115.5) internal successors, (462), 3 states have internal predecessors, (462), 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-03-16 19:23:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:11,584 INFO L93 Difference]: Finished difference Result 6161 states and 11105 transitions. [2025-03-16 19:23:11,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:23:11,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 3 states have internal predecessors, (462), 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 462 [2025-03-16 19:23:11,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:11,624 INFO L225 Difference]: With dead ends: 6161 [2025-03-16 19:23:11,624 INFO L226 Difference]: Without dead ends: 4907 [2025-03-16 19:23:11,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:23:11,632 INFO L435 NwaCegarLoop]: 3620 mSDtfsCounter, 7271 mSDsluCounter, 5590 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7271 SdHoareTripleChecker+Valid, 9210 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:11,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7271 Valid, 9210 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:23:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4907 states. [2025-03-16 19:23:11,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4907 to 2555. [2025-03-16 19:23:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2555 states, 2554 states have (on average 1.6413469068128426) internal successors, (4192), 2554 states have internal predecessors, (4192), 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-03-16 19:23:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 4192 transitions. [2025-03-16 19:23:11,781 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 4192 transitions. Word has length 462 [2025-03-16 19:23:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:11,782 INFO L471 AbstractCegarLoop]: Abstraction has 2555 states and 4192 transitions. [2025-03-16 19:23:11,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 3 states have internal predecessors, (462), 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-03-16 19:23:11,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 4192 transitions. [2025-03-16 19:23:11,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-16 19:23:11,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:11,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:11,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:23:11,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:11,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:11,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1068147297, now seen corresponding path program 1 times [2025-03-16 19:23:12,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:12,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747875183] [2025-03-16 19:23:12,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:12,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:12,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:12,003 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:12,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:23:12,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-16 19:23:12,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-16 19:23:12,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:12,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:12,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:12,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:12,558 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:12,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:12,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747875183] [2025-03-16 19:23:12,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747875183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:12,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:12,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:12,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720292799] [2025-03-16 19:23:12,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:12,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:12,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:12,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:12,561 INFO L87 Difference]: Start difference. First operand 2555 states and 4192 transitions. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-03-16 19:23:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:12,706 INFO L93 Difference]: Finished difference Result 7360 states and 12021 transitions. [2025-03-16 19:23:12,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:12,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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 464 [2025-03-16 19:23:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:12,727 INFO L225 Difference]: With dead ends: 7360 [2025-03-16 19:23:12,728 INFO L226 Difference]: Without dead ends: 4966 [2025-03-16 19:23:12,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 462 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-03-16 19:23:12,737 INFO L435 NwaCegarLoop]: 4129 mSDtfsCounter, 1836 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1836 SdHoareTripleChecker+Valid, 6231 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:12,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1836 Valid, 6231 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:12,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4966 states. [2025-03-16 19:23:12,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4966 to 4964. [2025-03-16 19:23:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4964 states, 4963 states have (on average 1.6308684263550273) internal successors, (8094), 4963 states have internal predecessors, (8094), 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-03-16 19:23:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4964 states to 4964 states and 8094 transitions. [2025-03-16 19:23:12,861 INFO L78 Accepts]: Start accepts. Automaton has 4964 states and 8094 transitions. Word has length 464 [2025-03-16 19:23:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:12,861 INFO L471 AbstractCegarLoop]: Abstraction has 4964 states and 8094 transitions. [2025-03-16 19:23:12,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 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-03-16 19:23:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4964 states and 8094 transitions. [2025-03-16 19:23:12,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-16 19:23:12,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:12,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:12,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 19:23:13,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:13,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash 12043231, now seen corresponding path program 1 times [2025-03-16 19:23:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:13,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500889711] [2025-03-16 19:23:13,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:13,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:13,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:23:13,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-16 19:23:13,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-16 19:23:13,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:13,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:13,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:13,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:13,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:13,408 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:13,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500889711] [2025-03-16 19:23:13,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500889711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:13,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:13,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:13,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227970286] [2025-03-16 19:23:13,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:13,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:13,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:13,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:13,411 INFO L87 Difference]: Start difference. First operand 4964 states and 8094 transitions. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-03-16 19:23:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:13,511 INFO L93 Difference]: Finished difference Result 14378 states and 23334 transitions. [2025-03-16 19:23:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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 465 [2025-03-16 19:23:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:13,543 INFO L225 Difference]: With dead ends: 14378 [2025-03-16 19:23:13,543 INFO L226 Difference]: Without dead ends: 9670 [2025-03-16 19:23:13,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 463 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-03-16 19:23:13,553 INFO L435 NwaCegarLoop]: 4113 mSDtfsCounter, 1965 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1965 SdHoareTripleChecker+Valid, 6261 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:13,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1965 Valid, 6261 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9670 states. [2025-03-16 19:23:13,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9670 to 5016. [2025-03-16 19:23:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5016 states, 5015 states have (on average 1.6299102691924228) internal successors, (8174), 5015 states have internal predecessors, (8174), 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-03-16 19:23:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5016 states to 5016 states and 8174 transitions. [2025-03-16 19:23:13,740 INFO L78 Accepts]: Start accepts. Automaton has 5016 states and 8174 transitions. Word has length 465 [2025-03-16 19:23:13,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:13,741 INFO L471 AbstractCegarLoop]: Abstraction has 5016 states and 8174 transitions. [2025-03-16 19:23:13,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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-03-16 19:23:13,741 INFO L276 IsEmpty]: Start isEmpty. Operand 5016 states and 8174 transitions. [2025-03-16 19:23:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-16 19:23:13,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:13,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:13,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 19:23:13,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:13,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:13,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1591317821, now seen corresponding path program 1 times [2025-03-16 19:23:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:13,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333236298] [2025-03-16 19:23:13,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:13,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:13,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:13,961 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:13,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 19:23:14,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-16 19:23:14,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-16 19:23:14,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:14,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:14,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:14,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:14,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:14,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:14,430 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:14,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333236298] [2025-03-16 19:23:14,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333236298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:14,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:14,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:14,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231549169] [2025-03-16 19:23:14,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:14,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:14,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:14,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:14,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:14,432 INFO L87 Difference]: Start difference. First operand 5016 states and 8174 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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-03-16 19:23:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:14,551 INFO L93 Difference]: Finished difference Result 14615 states and 23749 transitions. [2025-03-16 19:23:14,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:14,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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 466 [2025-03-16 19:23:14,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:14,577 INFO L225 Difference]: With dead ends: 14615 [2025-03-16 19:23:14,577 INFO L226 Difference]: Without dead ends: 9854 [2025-03-16 19:23:14,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 464 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-03-16 19:23:14,587 INFO L435 NwaCegarLoop]: 4199 mSDtfsCounter, 1889 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1889 SdHoareTripleChecker+Valid, 6301 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:14,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1889 Valid, 6301 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9854 states. [2025-03-16 19:23:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9854 to 9852. [2025-03-16 19:23:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9852 states, 9851 states have (on average 1.6216627753527562) internal successors, (15975), 9851 states have internal predecessors, (15975), 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-03-16 19:23:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9852 states to 9852 states and 15975 transitions. [2025-03-16 19:23:14,758 INFO L78 Accepts]: Start accepts. Automaton has 9852 states and 15975 transitions. Word has length 466 [2025-03-16 19:23:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:14,758 INFO L471 AbstractCegarLoop]: Abstraction has 9852 states and 15975 transitions. [2025-03-16 19:23:14,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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-03-16 19:23:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 9852 states and 15975 transitions. [2025-03-16 19:23:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-16 19:23:14,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:14,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:14,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 19:23:14,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:14,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:14,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:14,977 INFO L85 PathProgramCache]: Analyzing trace with hash -746315160, now seen corresponding path program 1 times [2025-03-16 19:23:14,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:14,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723258568] [2025-03-16 19:23:14,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:14,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:14,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:14,981 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:14,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 19:23:15,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-16 19:23:15,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-16 19:23:15,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:15,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:15,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:15,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:15,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:15,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:15,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723258568] [2025-03-16 19:23:15,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723258568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:15,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:15,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:15,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098879622] [2025-03-16 19:23:15,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:15,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:15,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:15,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:15,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:15,292 INFO L87 Difference]: Start difference. First operand 9852 states and 15975 transitions. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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-03-16 19:23:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:15,364 INFO L93 Difference]: Finished difference Result 28606 states and 46207 transitions. [2025-03-16 19:23:15,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:15,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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 466 [2025-03-16 19:23:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:15,395 INFO L225 Difference]: With dead ends: 28606 [2025-03-16 19:23:15,396 INFO L226 Difference]: Without dead ends: 19236 [2025-03-16 19:23:15,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 464 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-03-16 19:23:15,412 INFO L435 NwaCegarLoop]: 4117 mSDtfsCounter, 1964 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1964 SdHoareTripleChecker+Valid, 6265 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:15,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1964 Valid, 6265 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19236 states. [2025-03-16 19:23:15,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19236 to 10010. [2025-03-16 19:23:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10010 states, 10009 states have (on average 1.6198421420721352) internal successors, (16213), 10009 states have internal predecessors, (16213), 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-03-16 19:23:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10010 states to 10010 states and 16213 transitions. [2025-03-16 19:23:15,608 INFO L78 Accepts]: Start accepts. Automaton has 10010 states and 16213 transitions. Word has length 466 [2025-03-16 19:23:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:15,608 INFO L471 AbstractCegarLoop]: Abstraction has 10010 states and 16213 transitions. [2025-03-16 19:23:15,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 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-03-16 19:23:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 10010 states and 16213 transitions. [2025-03-16 19:23:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-16 19:23:15,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:15,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:15,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 19:23:15,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:15,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:15,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:15,825 INFO L85 PathProgramCache]: Analyzing trace with hash 592282756, now seen corresponding path program 1 times [2025-03-16 19:23:15,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:15,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [789935497] [2025-03-16 19:23:15,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:15,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:15,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:15,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:15,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 19:23:15,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-16 19:23:16,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-16 19:23:16,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:16,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:16,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:16,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:16,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:16,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:16,106 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:16,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789935497] [2025-03-16 19:23:16,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789935497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:16,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:16,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:16,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188407397] [2025-03-16 19:23:16,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:16,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:16,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:16,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:16,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:16,108 INFO L87 Difference]: Start difference. First operand 10010 states and 16213 transitions. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-03-16 19:23:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:16,188 INFO L93 Difference]: Finished difference Result 19594 states and 31625 transitions. [2025-03-16 19:23:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:16,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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 467 [2025-03-16 19:23:16,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:16,205 INFO L225 Difference]: With dead ends: 19594 [2025-03-16 19:23:16,205 INFO L226 Difference]: Without dead ends: 10200 [2025-03-16 19:23:16,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 465 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-03-16 19:23:16,215 INFO L435 NwaCegarLoop]: 2192 mSDtfsCounter, 18 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:16,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4352 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10200 states. [2025-03-16 19:23:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10200 to 10200. [2025-03-16 19:23:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10200 states, 10199 states have (on average 1.6133934699480341) internal successors, (16455), 10199 states have internal predecessors, (16455), 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-03-16 19:23:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10200 states to 10200 states and 16455 transitions. [2025-03-16 19:23:16,341 INFO L78 Accepts]: Start accepts. Automaton has 10200 states and 16455 transitions. Word has length 467 [2025-03-16 19:23:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:16,342 INFO L471 AbstractCegarLoop]: Abstraction has 10200 states and 16455 transitions. [2025-03-16 19:23:16,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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-03-16 19:23:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 10200 states and 16455 transitions. [2025-03-16 19:23:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-16 19:23:16,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:16,357 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:16,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 19:23:16,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:16,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:16,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1652107642, now seen corresponding path program 1 times [2025-03-16 19:23:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362667197] [2025-03-16 19:23:16,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:16,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:16,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:16,562 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:16,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 19:23:16,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-16 19:23:16,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-16 19:23:16,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:16,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:16,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:16,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:16,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:16,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:16,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:16,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362667197] [2025-03-16 19:23:16,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362667197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:16,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:16,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:16,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508472758] [2025-03-16 19:23:16,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:16,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:16,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:16,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:16,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:16,999 INFO L87 Difference]: Start difference. First operand 10200 states and 16455 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-03-16 19:23:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:17,124 INFO L93 Difference]: Finished difference Result 29707 states and 47843 transitions. [2025-03-16 19:23:17,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:17,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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 468 [2025-03-16 19:23:17,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:17,158 INFO L225 Difference]: With dead ends: 29707 [2025-03-16 19:23:17,159 INFO L226 Difference]: Without dead ends: 20035 [2025-03-16 19:23:17,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 466 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-03-16 19:23:17,174 INFO L435 NwaCegarLoop]: 4199 mSDtfsCounter, 1875 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 6301 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:17,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 6301 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20035 states. [2025-03-16 19:23:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20035 to 20033. [2025-03-16 19:23:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20033 states, 20032 states have (on average 1.6056309904153354) internal successors, (32164), 20032 states have internal predecessors, (32164), 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-03-16 19:23:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20033 states to 20033 states and 32164 transitions. [2025-03-16 19:23:17,525 INFO L78 Accepts]: Start accepts. Automaton has 20033 states and 32164 transitions. Word has length 468 [2025-03-16 19:23:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:17,526 INFO L471 AbstractCegarLoop]: Abstraction has 20033 states and 32164 transitions. [2025-03-16 19:23:17,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-03-16 19:23:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 20033 states and 32164 transitions. [2025-03-16 19:23:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-16 19:23:17,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:17,556 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:17,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 19:23:17,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:17,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:17,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:17,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1759893896, now seen corresponding path program 1 times [2025-03-16 19:23:17,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:17,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [729949727] [2025-03-16 19:23:17,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:17,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:17,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:17,762 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:17,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 19:23:17,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-16 19:23:18,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-16 19:23:18,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:18,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:18,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:23:18,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:18,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:18,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:18,128 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:18,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729949727] [2025-03-16 19:23:18,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729949727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:18,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:18,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:18,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152847989] [2025-03-16 19:23:18,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:18,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:18,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:18,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:18,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:18,129 INFO L87 Difference]: Start difference. First operand 20033 states and 32164 transitions. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 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-03-16 19:23:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:18,470 INFO L93 Difference]: Finished difference Result 68494 states and 110620 transitions. [2025-03-16 19:23:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:23:18,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 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 468 [2025-03-16 19:23:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:18,525 INFO L225 Difference]: With dead ends: 68494 [2025-03-16 19:23:18,526 INFO L226 Difference]: Without dead ends: 48541 [2025-03-16 19:23:18,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:23:18,548 INFO L435 NwaCegarLoop]: 3043 mSDtfsCounter, 7323 mSDsluCounter, 4911 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7323 SdHoareTripleChecker+Valid, 7954 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:18,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7323 Valid, 7954 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:23:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48541 states. [2025-03-16 19:23:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48541 to 20241. [2025-03-16 19:23:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20241 states, 20240 states have (on average 1.6068675889328063) internal successors, (32523), 20240 states have internal predecessors, (32523), 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-03-16 19:23:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20241 states to 20241 states and 32523 transitions. [2025-03-16 19:23:18,864 INFO L78 Accepts]: Start accepts. Automaton has 20241 states and 32523 transitions. Word has length 468 [2025-03-16 19:23:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:18,864 INFO L471 AbstractCegarLoop]: Abstraction has 20241 states and 32523 transitions. [2025-03-16 19:23:18,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 3 states have internal predecessors, (468), 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-03-16 19:23:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 20241 states and 32523 transitions. [2025-03-16 19:23:18,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-16 19:23:18,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:18,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:18,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 19:23:19,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:19,088 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:19,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:19,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1614671823, now seen corresponding path program 1 times [2025-03-16 19:23:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393393402] [2025-03-16 19:23:19,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:19,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:19,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:19,092 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:19,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 19:23:19,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-16 19:23:19,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-16 19:23:19,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:19,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:19,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:19,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:19,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:19,395 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:19,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393393402] [2025-03-16 19:23:19,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393393402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:19,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:19,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:19,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230942669] [2025-03-16 19:23:19,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:19,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:19,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:19,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:19,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:19,398 INFO L87 Difference]: Start difference. First operand 20241 states and 32523 transitions. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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-03-16 19:23:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:19,503 INFO L93 Difference]: Finished difference Result 60492 states and 97141 transitions. [2025-03-16 19:23:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:19,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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 471 [2025-03-16 19:23:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:19,548 INFO L225 Difference]: With dead ends: 60492 [2025-03-16 19:23:19,549 INFO L226 Difference]: Without dead ends: 40360 [2025-03-16 19:23:19,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 469 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-03-16 19:23:19,575 INFO L435 NwaCegarLoop]: 4233 mSDtfsCounter, 2085 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2085 SdHoareTripleChecker+Valid, 6381 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:19,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2085 Valid, 6381 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40360 states. [2025-03-16 19:23:19,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40360 to 20330. [2025-03-16 19:23:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20330 states, 20329 states have (on average 1.6066210831816616) internal successors, (32661), 20329 states have internal predecessors, (32661), 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-03-16 19:23:19,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20330 states to 20330 states and 32661 transitions. [2025-03-16 19:23:19,970 INFO L78 Accepts]: Start accepts. Automaton has 20330 states and 32661 transitions. Word has length 471 [2025-03-16 19:23:19,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:19,970 INFO L471 AbstractCegarLoop]: Abstraction has 20330 states and 32661 transitions. [2025-03-16 19:23:19,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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-03-16 19:23:19,970 INFO L276 IsEmpty]: Start isEmpty. Operand 20330 states and 32661 transitions. [2025-03-16 19:23:19,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-16 19:23:19,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:19,986 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:19,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 19:23:20,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:20,191 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:20,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:20,192 INFO L85 PathProgramCache]: Analyzing trace with hash -2016595019, now seen corresponding path program 1 times [2025-03-16 19:23:20,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:20,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645654179] [2025-03-16 19:23:20,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:20,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:20,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:20,196 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:20,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 19:23:20,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-16 19:23:20,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-16 19:23:20,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:20,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:20,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:20,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:20,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:20,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:20,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:20,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645654179] [2025-03-16 19:23:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645654179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:20,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:20,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479593523] [2025-03-16 19:23:20,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:20,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:20,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:20,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:20,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:20,477 INFO L87 Difference]: Start difference. First operand 20330 states and 32661 transitions. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-03-16 19:23:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:20,591 INFO L93 Difference]: Finished difference Result 60631 states and 97341 transitions. [2025-03-16 19:23:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:20,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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 472 [2025-03-16 19:23:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:20,639 INFO L225 Difference]: With dead ends: 60631 [2025-03-16 19:23:20,640 INFO L226 Difference]: Without dead ends: 40495 [2025-03-16 19:23:20,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 470 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-03-16 19:23:20,663 INFO L435 NwaCegarLoop]: 4237 mSDtfsCounter, 2084 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2084 SdHoareTripleChecker+Valid, 6385 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:20,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2084 Valid, 6385 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:20,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40495 states. [2025-03-16 19:23:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40495 to 20465. [2025-03-16 19:23:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20465 states, 20464 states have (on average 1.6060887412040656) internal successors, (32867), 20464 states have internal predecessors, (32867), 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-03-16 19:23:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20465 states to 20465 states and 32867 transitions. [2025-03-16 19:23:21,062 INFO L78 Accepts]: Start accepts. Automaton has 20465 states and 32867 transitions. Word has length 472 [2025-03-16 19:23:21,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:21,062 INFO L471 AbstractCegarLoop]: Abstraction has 20465 states and 32867 transitions. [2025-03-16 19:23:21,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-03-16 19:23:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 20465 states and 32867 transitions. [2025-03-16 19:23:21,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-16 19:23:21,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:21,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:21,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 19:23:21,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:21,286 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:21,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash -429044431, now seen corresponding path program 1 times [2025-03-16 19:23:21,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:21,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826215421] [2025-03-16 19:23:21,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:21,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:21,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:21,289 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:21,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 19:23:21,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-16 19:23:21,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-16 19:23:21,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:21,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:21,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:21,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:21,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:21,577 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:21,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826215421] [2025-03-16 19:23:21,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826215421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:21,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:21,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:21,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309887854] [2025-03-16 19:23:21,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:21,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:21,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:21,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:21,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:21,578 INFO L87 Difference]: Start difference. First operand 20465 states and 32867 transitions. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-03-16 19:23:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:21,674 INFO L93 Difference]: Finished difference Result 40736 states and 65368 transitions. [2025-03-16 19:23:21,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:21,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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 473 [2025-03-16 19:23:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:21,695 INFO L225 Difference]: With dead ends: 40736 [2025-03-16 19:23:21,696 INFO L226 Difference]: Without dead ends: 20609 [2025-03-16 19:23:21,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 471 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-03-16 19:23:21,713 INFO L435 NwaCegarLoop]: 2192 mSDtfsCounter, 18 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:21,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4352 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20609 states. [2025-03-16 19:23:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20609 to 20609. [2025-03-16 19:23:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20609 states, 20608 states have (on average 1.6034549689440993) internal successors, (33044), 20608 states have internal predecessors, (33044), 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-03-16 19:23:22,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20609 states to 20609 states and 33044 transitions. [2025-03-16 19:23:22,044 INFO L78 Accepts]: Start accepts. Automaton has 20609 states and 33044 transitions. Word has length 473 [2025-03-16 19:23:22,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:22,045 INFO L471 AbstractCegarLoop]: Abstraction has 20609 states and 33044 transitions. [2025-03-16 19:23:22,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-03-16 19:23:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 20609 states and 33044 transitions. [2025-03-16 19:23:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-16 19:23:22,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:22,066 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:22,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-16 19:23:22,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:22,267 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:22,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1495097045, now seen corresponding path program 1 times [2025-03-16 19:23:22,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:22,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1307421058] [2025-03-16 19:23:22,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:22,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:22,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:22,270 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:22,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 19:23:22,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-16 19:23:22,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-16 19:23:22,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:22,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:22,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:23:22,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:22,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:22,719 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:22,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307421058] [2025-03-16 19:23:22,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307421058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:22,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:22,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:22,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845322685] [2025-03-16 19:23:22,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:22,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:22,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:22,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:22,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:22,720 INFO L87 Difference]: Start difference. First operand 20609 states and 33044 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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-03-16 19:23:23,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:23,017 INFO L93 Difference]: Finished difference Result 102118 states and 163713 transitions. [2025-03-16 19:23:23,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:23:23,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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 474 [2025-03-16 19:23:23,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:23,122 INFO L225 Difference]: With dead ends: 102118 [2025-03-16 19:23:23,123 INFO L226 Difference]: Without dead ends: 81521 [2025-03-16 19:23:23,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:23:23,167 INFO L435 NwaCegarLoop]: 3283 mSDtfsCounter, 6909 mSDsluCounter, 5131 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6909 SdHoareTripleChecker+Valid, 8414 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:23,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6909 Valid, 8414 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81521 states. [2025-03-16 19:23:23,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81521 to 40785. [2025-03-16 19:23:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40785 states, 40784 states have (on average 1.5964348764221263) internal successors, (65109), 40784 states have internal predecessors, (65109), 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-03-16 19:23:23,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40785 states to 40785 states and 65109 transitions. [2025-03-16 19:23:23,948 INFO L78 Accepts]: Start accepts. Automaton has 40785 states and 65109 transitions. Word has length 474 [2025-03-16 19:23:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:23,948 INFO L471 AbstractCegarLoop]: Abstraction has 40785 states and 65109 transitions. [2025-03-16 19:23:23,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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-03-16 19:23:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 40785 states and 65109 transitions. [2025-03-16 19:23:23,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-16 19:23:23,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:23,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:23,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-16 19:23:24,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:24,180 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:24,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:24,180 INFO L85 PathProgramCache]: Analyzing trace with hash 195251193, now seen corresponding path program 1 times [2025-03-16 19:23:24,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:24,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1272093753] [2025-03-16 19:23:24,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:24,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:24,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:24,183 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:24,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-16 19:23:24,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-16 19:23:24,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-16 19:23:24,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:24,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:24,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:24,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:24,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:24,603 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:24,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272093753] [2025-03-16 19:23:24,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272093753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:24,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:24,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:24,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877146966] [2025-03-16 19:23:24,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:24,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:24,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:24,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:24,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:24,605 INFO L87 Difference]: Start difference. First operand 40785 states and 65109 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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-03-16 19:23:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:25,027 INFO L93 Difference]: Finished difference Result 117937 states and 188236 transitions. [2025-03-16 19:23:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:25,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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 476 [2025-03-16 19:23:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:25,119 INFO L225 Difference]: With dead ends: 117937 [2025-03-16 19:23:25,119 INFO L226 Difference]: Without dead ends: 80811 [2025-03-16 19:23:25,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 474 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-03-16 19:23:25,152 INFO L435 NwaCegarLoop]: 4175 mSDtfsCounter, 1913 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1913 SdHoareTripleChecker+Valid, 6277 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:25,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1913 Valid, 6277 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:25,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80811 states. [2025-03-16 19:23:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80811 to 80809. [2025-03-16 19:23:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80809 states, 80808 states have (on average 1.5900653400653402) internal successors, (128490), 80808 states have internal predecessors, (128490), 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-03-16 19:23:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80809 states to 80809 states and 128490 transitions. [2025-03-16 19:23:26,164 INFO L78 Accepts]: Start accepts. Automaton has 80809 states and 128490 transitions. Word has length 476 [2025-03-16 19:23:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:26,164 INFO L471 AbstractCegarLoop]: Abstraction has 80809 states and 128490 transitions. [2025-03-16 19:23:26,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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-03-16 19:23:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 80809 states and 128490 transitions. [2025-03-16 19:23:26,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-16 19:23:26,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:26,250 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:26,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-16 19:23:26,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:26,451 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:26,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash -787664695, now seen corresponding path program 1 times [2025-03-16 19:23:26,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:26,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364906944] [2025-03-16 19:23:26,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:26,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:26,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:26,455 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:26,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-16 19:23:26,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-16 19:23:26,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-16 19:23:26,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:26,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:26,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:26,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:26,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:26,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:26,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:26,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364906944] [2025-03-16 19:23:26,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364906944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:26,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:26,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:26,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368141737] [2025-03-16 19:23:26,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:26,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:26,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:26,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:26,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:26,864 INFO L87 Difference]: Start difference. First operand 80809 states and 128490 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-03-16 19:23:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:27,399 INFO L93 Difference]: Finished difference Result 242332 states and 385296 transitions. [2025-03-16 19:23:27,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:27,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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 477 [2025-03-16 19:23:27,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:27,572 INFO L225 Difference]: With dead ends: 242332 [2025-03-16 19:23:27,573 INFO L226 Difference]: Without dead ends: 161570 [2025-03-16 19:23:27,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 475 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-03-16 19:23:27,620 INFO L435 NwaCegarLoop]: 4293 mSDtfsCounter, 2145 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 6441 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:27,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 6441 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161570 states. [2025-03-16 19:23:28,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161570 to 80856. [2025-03-16 19:23:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80856 states, 80855 states have (on average 1.5900562735761548) internal successors, (128564), 80855 states have internal predecessors, (128564), 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-03-16 19:23:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80856 states to 80856 states and 128564 transitions. [2025-03-16 19:23:29,187 INFO L78 Accepts]: Start accepts. Automaton has 80856 states and 128564 transitions. Word has length 477 [2025-03-16 19:23:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:29,187 INFO L471 AbstractCegarLoop]: Abstraction has 80856 states and 128564 transitions. [2025-03-16 19:23:29,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-03-16 19:23:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 80856 states and 128564 transitions. [2025-03-16 19:23:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-16 19:23:29,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:29,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:29,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-16 19:23:29,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:29,472 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:29,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:29,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1694537443, now seen corresponding path program 1 times [2025-03-16 19:23:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:29,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46228669] [2025-03-16 19:23:29,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:29,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:29,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:29,476 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:29,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-16 19:23:29,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-16 19:23:29,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-16 19:23:29,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:29,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:29,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:29,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:30,111 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:30,111 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46228669] [2025-03-16 19:23:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46228669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:30,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:30,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760695228] [2025-03-16 19:23:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:30,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:30,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:30,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:30,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:30,113 INFO L87 Difference]: Start difference. First operand 80856 states and 128564 transitions. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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-03-16 19:23:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:30,695 INFO L93 Difference]: Finished difference Result 234573 states and 372903 transitions. [2025-03-16 19:23:30,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:30,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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 478 [2025-03-16 19:23:30,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:30,880 INFO L225 Difference]: With dead ends: 234573 [2025-03-16 19:23:30,880 INFO L226 Difference]: Without dead ends: 158907 [2025-03-16 19:23:30,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 476 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-03-16 19:23:30,945 INFO L435 NwaCegarLoop]: 4259 mSDtfsCounter, 1905 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1905 SdHoareTripleChecker+Valid, 6361 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:30,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1905 Valid, 6361 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:31,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158907 states. [2025-03-16 19:23:32,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158907 to 158905. [2025-03-16 19:23:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158905 states, 158904 states have (on average 1.5835158334591954) internal successors, (251627), 158904 states have internal predecessors, (251627), 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-03-16 19:23:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158905 states to 158905 states and 251627 transitions. [2025-03-16 19:23:33,228 INFO L78 Accepts]: Start accepts. Automaton has 158905 states and 251627 transitions. Word has length 478 [2025-03-16 19:23:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:33,228 INFO L471 AbstractCegarLoop]: Abstraction has 158905 states and 251627 transitions. [2025-03-16 19:23:33,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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-03-16 19:23:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 158905 states and 251627 transitions. [2025-03-16 19:23:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-16 19:23:33,361 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:33,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:33,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-16 19:23:33,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:33,565 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:33,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:33,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1178137154, now seen corresponding path program 1 times [2025-03-16 19:23:33,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:33,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1327817408] [2025-03-16 19:23:33,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:33,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:33,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:33,568 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:33,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-16 19:23:33,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-16 19:23:33,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-16 19:23:33,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:33,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:33,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:33,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:33,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:33,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:33,837 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:33,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327817408] [2025-03-16 19:23:33,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327817408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:33,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:33,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035237647] [2025-03-16 19:23:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:33,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:33,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:33,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:33,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:33,838 INFO L87 Difference]: Start difference. First operand 158905 states and 251627 transitions. Second operand has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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-03-16 19:23:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:35,012 INFO L93 Difference]: Finished difference Result 476469 states and 754446 transitions. [2025-03-16 19:23:35,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:35,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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 478 [2025-03-16 19:23:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:35,386 INFO L225 Difference]: With dead ends: 476469 [2025-03-16 19:23:35,386 INFO L226 Difference]: Without dead ends: 317703 [2025-03-16 19:23:35,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 476 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-03-16 19:23:35,513 INFO L435 NwaCegarLoop]: 4297 mSDtfsCounter, 2144 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2144 SdHoareTripleChecker+Valid, 6445 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:35,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2144 Valid, 6445 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317703 states. [2025-03-16 19:23:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317703 to 159003. [2025-03-16 19:23:38,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159003 states, 159002 states have (on average 1.5834895158551465) internal successors, (251778), 159002 states have internal predecessors, (251778), 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-03-16 19:23:38,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159003 states to 159003 states and 251778 transitions. [2025-03-16 19:23:38,806 INFO L78 Accepts]: Start accepts. Automaton has 159003 states and 251778 transitions. Word has length 478 [2025-03-16 19:23:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:38,807 INFO L471 AbstractCegarLoop]: Abstraction has 159003 states and 251778 transitions. [2025-03-16 19:23:38,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 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-03-16 19:23:38,807 INFO L276 IsEmpty]: Start isEmpty. Operand 159003 states and 251778 transitions. [2025-03-16 19:23:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-16 19:23:38,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:38,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:38,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-16 19:23:39,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:39,139 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:39,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:39,140 INFO L85 PathProgramCache]: Analyzing trace with hash 330608878, now seen corresponding path program 1 times [2025-03-16 19:23:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:39,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856477736] [2025-03-16 19:23:39,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:39,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:39,143 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:39,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-16 19:23:39,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-16 19:23:39,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-16 19:23:39,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:39,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:39,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:39,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:39,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:39,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:39,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856477736] [2025-03-16 19:23:39,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856477736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:39,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:39,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:39,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904582926] [2025-03-16 19:23:39,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:39,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:39,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:39,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:39,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:39,385 INFO L87 Difference]: Start difference. First operand 159003 states and 251778 transitions. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-03-16 19:23:40,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:40,223 INFO L93 Difference]: Finished difference Result 317904 states and 503356 transitions. [2025-03-16 19:23:40,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:40,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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 479 [2025-03-16 19:23:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:40,437 INFO L225 Difference]: With dead ends: 317904 [2025-03-16 19:23:40,437 INFO L226 Difference]: Without dead ends: 159120 [2025-03-16 19:23:40,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 477 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-03-16 19:23:40,569 INFO L435 NwaCegarLoop]: 2192 mSDtfsCounter, 18 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4352 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:40,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4352 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:40,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159120 states. [2025-03-16 19:23:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159120 to 159120. [2025-03-16 19:23:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159120 states, 159119 states have (on average 1.5832427302836243) internal successors, (251924), 159119 states have internal predecessors, (251924), 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-03-16 19:23:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159120 states to 159120 states and 251924 transitions. [2025-03-16 19:23:42,912 INFO L78 Accepts]: Start accepts. Automaton has 159120 states and 251924 transitions. Word has length 479 [2025-03-16 19:23:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:42,912 INFO L471 AbstractCegarLoop]: Abstraction has 159120 states and 251924 transitions. [2025-03-16 19:23:42,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-03-16 19:23:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 159120 states and 251924 transitions. [2025-03-16 19:23:43,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-16 19:23:43,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:43,057 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:43,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-16 19:23:43,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:43,258 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:43,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash 564380000, now seen corresponding path program 1 times [2025-03-16 19:23:43,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:43,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399949617] [2025-03-16 19:23:43,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:43,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:43,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:43,262 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:43,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-16 19:23:43,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-16 19:23:43,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-16 19:23:43,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:43,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:43,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 19:23:43,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:43,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:43,691 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:43,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399949617] [2025-03-16 19:23:43,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399949617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:43,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:43,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:43,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246615667] [2025-03-16 19:23:43,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:43,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:43,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:43,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:43,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:43,692 INFO L87 Difference]: Start difference. First operand 159120 states and 251924 transitions. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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-03-16 19:23:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:44,881 INFO L93 Difference]: Finished difference Result 456725 states and 722971 transitions. [2025-03-16 19:23:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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 480 [2025-03-16 19:23:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:45,317 INFO L225 Difference]: With dead ends: 456725 [2025-03-16 19:23:45,318 INFO L226 Difference]: Without dead ends: 310331 [2025-03-16 19:23:45,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 478 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-03-16 19:23:45,470 INFO L435 NwaCegarLoop]: 4259 mSDtfsCounter, 1898 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1898 SdHoareTripleChecker+Valid, 6361 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:45,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1898 Valid, 6361 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310331 states. [2025-03-16 19:23:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310331 to 310329. [2025-03-16 19:23:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310329 states, 310328 states have (on average 1.5766769353716068) internal successors, (489287), 310328 states have internal predecessors, (489287), 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-03-16 19:23:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310329 states to 310329 states and 489287 transitions. [2025-03-16 19:23:50,336 INFO L78 Accepts]: Start accepts. Automaton has 310329 states and 489287 transitions. Word has length 480 [2025-03-16 19:23:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:50,337 INFO L471 AbstractCegarLoop]: Abstraction has 310329 states and 489287 transitions. [2025-03-16 19:23:50,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 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-03-16 19:23:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 310329 states and 489287 transitions. [2025-03-16 19:23:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-16 19:23:50,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:50,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 19:23:50,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-16 19:23:50,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:50,803 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:50,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:50,804 INFO L85 PathProgramCache]: Analyzing trace with hash 139258722, now seen corresponding path program 1 times [2025-03-16 19:23:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 19:23:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1420612288] [2025-03-16 19:23:50,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:50,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:23:50,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:50,808 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:23:50,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-16 19:23:50,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-16 19:23:51,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-16 19:23:51,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:51,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:51,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 19:23:51,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:23:51,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:51,705 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 19:23:51,705 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 19:23:51,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420612288] [2025-03-16 19:23:51,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420612288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:51,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:51,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:51,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362470651] [2025-03-16 19:23:51,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:51,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:51,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 19:23:51,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:51,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:51,707 INFO L87 Difference]: Start difference. First operand 310329 states and 489287 transitions. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 3 states have internal predecessors, (480), 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-03-16 19:23:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:53,880 INFO L93 Difference]: Finished difference Result 915185 states and 1442331 transitions. [2025-03-16 19:23:53,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:23:53,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 3 states have internal predecessors, (480), 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 480 [2025-03-16 19:23:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:54,643 INFO L225 Difference]: With dead ends: 915185 [2025-03-16 19:23:54,644 INFO L226 Difference]: Without dead ends: 609587