./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 839c364b Calling Ultimate with: /usr/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:28:45,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:28:45,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:28:45,886 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:28:45,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:28:45,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:28:45,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:28:45,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:28:45,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:28:45,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:28:45,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:28:45,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:28:45,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:28:45,907 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:28:45,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:28:45,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:28:45,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:28:45,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:28:45,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:28:45,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:28:45,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:28:45,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:28:45,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:28:45,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:28:45,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:28:45,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:28:45,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:28:45,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:28:45,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:28:45,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:28:45,934 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:28:45,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:28:45,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:28:45,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:28:45,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:28:45,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:28:45,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:28:45,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:28:45,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:28:45,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:28:45,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:28:45,940 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2021-12-14 19:28:45,963 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:28:45,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:28:45,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:28:45,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:28:45,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:28:45,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:28:45,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:28:45,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:28:45,966 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:28:45,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:28:45,967 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:28:45,967 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:28:45,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:28:45,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:28:45,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:28:45,967 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:28:45,967 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:28:45,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:28:45,968 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:28:45,968 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:28:45,968 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:28:45,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:28:45,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:28:45,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:28:45,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:28:45,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:28:45,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:28:45,969 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:28:45,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:28:45,969 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:28:45,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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.graphml 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 valid-memcleanup) ) 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 -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2021-12-14 19:28:46,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:28:46,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:28:46,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:28:46,169 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:28:46,169 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:28:46,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-12-14 19:28:46,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9343b67/a5a397b137a2408a965fd672262beca5/FLAG1003b9805 [2021-12-14 19:28:46,610 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:28:46,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-12-14 19:28:46,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9343b67/a5a397b137a2408a965fd672262beca5/FLAG1003b9805 [2021-12-14 19:28:47,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9343b67/a5a397b137a2408a965fd672262beca5 [2021-12-14 19:28:47,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:28:47,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:28:47,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:28:47,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:28:47,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:28:47,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aba8266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47, skipping insertion in model container [2021-12-14 19:28:47,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:28:47,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:28:47,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2021-12-14 19:28:47,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2021-12-14 19:28:47,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2021-12-14 19:28:47,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2021-12-14 19:28:47,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2021-12-14 19:28:47,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2021-12-14 19:28:47,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2021-12-14 19:28:47,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2021-12-14 19:28:47,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2021-12-14 19:28:47,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2021-12-14 19:28:47,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2021-12-14 19:28:47,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2021-12-14 19:28:47,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2021-12-14 19:28:47,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2021-12-14 19:28:47,286 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:28:47,291 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:28:47,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2021-12-14 19:28:47,313 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2021-12-14 19:28:47,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2021-12-14 19:28:47,314 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2021-12-14 19:28:47,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2021-12-14 19:28:47,315 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2021-12-14 19:28:47,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2021-12-14 19:28:47,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2021-12-14 19:28:47,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2021-12-14 19:28:47,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2021-12-14 19:28:47,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2021-12-14 19:28:47,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2021-12-14 19:28:47,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2021-12-14 19:28:47,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2021-12-14 19:28:47,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:28:47,338 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:28:47,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47 WrapperNode [2021-12-14 19:28:47,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:28:47,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:28:47,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:28:47,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:28:47,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,386 INFO L137 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 222 [2021-12-14 19:28:47,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:28:47,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:28:47,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:28:47,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:28:47,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,396 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,402 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:28:47,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:28:47,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:28:47,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:28:47,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (1/1) ... [2021-12-14 19:28:47,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:28:47,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:28:47,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:28:47,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:28:47,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-14 19:28:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-14 19:28:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:28:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:28:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:28:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:28:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:28:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-14 19:28:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:28:47,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:28:47,552 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:28:47,553 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:28:47,890 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:28:47,897 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:28:47,898 INFO L301 CfgBuilder]: Removed 31 assume(true) statements. [2021-12-14 19:28:47,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:28:47 BoogieIcfgContainer [2021-12-14 19:28:47,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:28:47,901 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:28:47,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:28:47,903 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:28:47,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:28:47" (1/3) ... [2021-12-14 19:28:47,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f294e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:28:47, skipping insertion in model container [2021-12-14 19:28:47,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:28:47" (2/3) ... [2021-12-14 19:28:47,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48f294e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:28:47, skipping insertion in model container [2021-12-14 19:28:47,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:28:47" (3/3) ... [2021-12-14 19:28:47,905 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2021-12-14 19:28:47,909 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:28:47,909 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2021-12-14 19:28:47,937 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:28:47,942 INFO L339 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:28:47,942 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2021-12-14 19:28:47,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 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) [2021-12-14 19:28:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:28:47,958 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:47,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:28:47,958 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:47,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:28:47,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:47,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96878895] [2021-12-14 19:28:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:47,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:48,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:48,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96878895] [2021-12-14 19:28:48,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96878895] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:48,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:48,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:28:48,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687057943] [2021-12-14 19:28:48,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:48,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:28:48,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:48,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:28:48,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:28:48,118 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 2.26) internal successors, (226), 170 states have internal predecessors, (226), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-14 19:28:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:48,256 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2021-12-14 19:28:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:28:48,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-14 19:28:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:48,269 INFO L225 Difference]: With dead ends: 169 [2021-12-14 19:28:48,270 INFO L226 Difference]: Without dead ends: 165 [2021-12-14 19:28:48,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:28:48,275 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 160 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:48,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 109 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:28:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-12-14 19:28:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2021-12-14 19:28:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 101 states have (on average 1.7128712871287128) internal successors, (173), 160 states have internal predecessors, (173), 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) [2021-12-14 19:28:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2021-12-14 19:28:48,326 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 3 [2021-12-14 19:28:48,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:48,326 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2021-12-14 19:28:48,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-14 19:28:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2021-12-14 19:28:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:28:48,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:48,327 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:28:48,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-14 19:28:48,327 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:28:48,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:48,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809727844] [2021-12-14 19:28:48,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:48,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:48,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:48,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809727844] [2021-12-14 19:28:48,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809727844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:48,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:48,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:28:48,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291729991] [2021-12-14 19:28:48,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:48,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:28:48,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:48,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:28:48,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:28:48,384 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-14 19:28:48,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:48,466 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2021-12-14 19:28:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:28:48,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-14 19:28:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:48,474 INFO L225 Difference]: With dead ends: 155 [2021-12-14 19:28:48,474 INFO L226 Difference]: Without dead ends: 155 [2021-12-14 19:28:48,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:28:48,476 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 147 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:48,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 112 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:28:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2021-12-14 19:28:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2021-12-14 19:28:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.603960396039604) internal successors, (162), 150 states have internal predecessors, (162), 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) [2021-12-14 19:28:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2021-12-14 19:28:48,509 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2021-12-14 19:28:48,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:48,510 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2021-12-14 19:28:48,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-14 19:28:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2021-12-14 19:28:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:28:48,511 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:48,511 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:48,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-14 19:28:48,512 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:48,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-14 19:28:48,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:48,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526191772] [2021-12-14 19:28:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:48,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:48,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:48,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526191772] [2021-12-14 19:28:48,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526191772] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:48,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:48,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:28:48,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819003096] [2021-12-14 19:28:48,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:48,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:28:48,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:48,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:28:48,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:28:48,583 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-14 19:28:48,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:48,663 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2021-12-14 19:28:48,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:28:48,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2021-12-14 19:28:48,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:48,664 INFO L225 Difference]: With dead ends: 161 [2021-12-14 19:28:48,664 INFO L226 Difference]: Without dead ends: 161 [2021-12-14 19:28:48,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:28:48,665 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 260 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:48,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 116 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:28:48,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-14 19:28:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2021-12-14 19:28:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.5555555555555556) internal successors, (168), 152 states have internal predecessors, (168), 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) [2021-12-14 19:28:48,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2021-12-14 19:28:48,670 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 8 [2021-12-14 19:28:48,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:48,671 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2021-12-14 19:28:48,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-14 19:28:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2021-12-14 19:28:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:28:48,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:48,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:48,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-14 19:28:48,672 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-14 19:28:48,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:48,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716956489] [2021-12-14 19:28:48,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:48,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:48,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:48,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716956489] [2021-12-14 19:28:48,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716956489] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:48,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:48,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:28:48,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579343868] [2021-12-14 19:28:48,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:48,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:28:48,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:48,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:28:48,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:28:48,724 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-14 19:28:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:48,856 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2021-12-14 19:28:48,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:28:48,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2021-12-14 19:28:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:48,858 INFO L225 Difference]: With dead ends: 244 [2021-12-14 19:28:48,858 INFO L226 Difference]: Without dead ends: 244 [2021-12-14 19:28:48,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:28:48,859 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 318 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:48,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 184 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:28:48,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-12-14 19:28:48,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 158. [2021-12-14 19:28:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5309734513274336) internal successors, (173), 157 states have internal predecessors, (173), 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) [2021-12-14 19:28:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2021-12-14 19:28:48,865 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 8 [2021-12-14 19:28:48,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:48,865 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2021-12-14 19:28:48,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-14 19:28:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2021-12-14 19:28:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-14 19:28:48,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:48,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:48,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-14 19:28:48,866 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:48,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1837174119, now seen corresponding path program 1 times [2021-12-14 19:28:48,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:48,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251518415] [2021-12-14 19:28:48,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:48,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:48,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:48,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251518415] [2021-12-14 19:28:48,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251518415] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:48,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:48,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:28:48,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392471375] [2021-12-14 19:28:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:48,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:28:48,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:48,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:28:48,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:28:48,922 INFO L87 Difference]: Start difference. First operand 158 states and 173 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2021-12-14 19:28:48,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:48,947 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2021-12-14 19:28:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:28:48,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2021-12-14 19:28:48,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:48,948 INFO L225 Difference]: With dead ends: 148 [2021-12-14 19:28:48,948 INFO L226 Difference]: Without dead ends: 148 [2021-12-14 19:28:48,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:28:48,949 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 125 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:48,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:28:48,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-12-14 19:28:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2021-12-14 19:28:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.5) internal successors, (162), 147 states have internal predecessors, (162), 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) [2021-12-14 19:28:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2021-12-14 19:28:48,953 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 9 [2021-12-14 19:28:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:48,954 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2021-12-14 19:28:48,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2021-12-14 19:28:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2021-12-14 19:28:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:28:48,954 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:48,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:48,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-14 19:28:48,955 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-14 19:28:48,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:48,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661248588] [2021-12-14 19:28:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:48,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:49,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:49,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:49,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661248588] [2021-12-14 19:28:49,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661248588] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:49,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:49,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:28:49,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427216626] [2021-12-14 19:28:49,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:49,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:28:49,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:49,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:28:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:28:49,024 INFO L87 Difference]: Start difference. First operand 148 states and 162 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-12-14 19:28:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:49,218 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2021-12-14 19:28:49,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:28:49,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2021-12-14 19:28:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:49,219 INFO L225 Difference]: With dead ends: 219 [2021-12-14 19:28:49,219 INFO L226 Difference]: Without dead ends: 219 [2021-12-14 19:28:49,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:28:49,220 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 110 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:49,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 682 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:28:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2021-12-14 19:28:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 147. [2021-12-14 19:28:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 146 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:28:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2021-12-14 19:28:49,224 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 12 [2021-12-14 19:28:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:49,224 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2021-12-14 19:28:49,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-12-14 19:28:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2021-12-14 19:28:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:28:49,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:49,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:49,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-14 19:28:49,225 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:49,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:49,226 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-14 19:28:49,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:49,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130833191] [2021-12-14 19:28:49,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:49,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:49,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:49,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130833191] [2021-12-14 19:28:49,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130833191] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:49,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:49,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:28:49,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622947061] [2021-12-14 19:28:49,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:49,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:28:49,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:49,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:28:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:28:49,302 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-12-14 19:28:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:49,509 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2021-12-14 19:28:49,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:28:49,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2021-12-14 19:28:49,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:49,510 INFO L225 Difference]: With dead ends: 211 [2021-12-14 19:28:49,510 INFO L226 Difference]: Without dead ends: 211 [2021-12-14 19:28:49,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:28:49,511 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 97 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:49,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 676 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:28:49,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-14 19:28:49,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 136. [2021-12-14 19:28:49,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 135 states have internal predecessors, (149), 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) [2021-12-14 19:28:49,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2021-12-14 19:28:49,513 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 12 [2021-12-14 19:28:49,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:49,514 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2021-12-14 19:28:49,514 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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) [2021-12-14 19:28:49,514 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2021-12-14 19:28:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-14 19:28:49,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:49,514 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:49,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-14 19:28:49,514 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1603335132, now seen corresponding path program 1 times [2021-12-14 19:28:49,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:49,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848187256] [2021-12-14 19:28:49,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:49,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:49,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:49,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848187256] [2021-12-14 19:28:49,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848187256] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:49,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:49,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:28:49,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142809284] [2021-12-14 19:28:49,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:49,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:28:49,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:49,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:28:49,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:28:49,538 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2021-12-14 19:28:49,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:49,553 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2021-12-14 19:28:49,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:28:49,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2021-12-14 19:28:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:49,554 INFO L225 Difference]: With dead ends: 191 [2021-12-14 19:28:49,554 INFO L226 Difference]: Without dead ends: 191 [2021-12-14 19:28:49,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:28:49,555 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 47 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:49,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 250 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:28:49,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-14 19:28:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 149. [2021-12-14 19:28:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.4051724137931034) internal successors, (163), 148 states have internal predecessors, (163), 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) [2021-12-14 19:28:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2021-12-14 19:28:49,558 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 15 [2021-12-14 19:28:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:49,559 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2021-12-14 19:28:49,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) [2021-12-14 19:28:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2021-12-14 19:28:49,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:28:49,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:49,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:49,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-14 19:28:49,560 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:49,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:49,560 INFO L85 PathProgramCache]: Analyzing trace with hash -775737061, now seen corresponding path program 1 times [2021-12-14 19:28:49,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:49,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538502920] [2021-12-14 19:28:49,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:49,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:49,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:49,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538502920] [2021-12-14 19:28:49,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538502920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:49,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:49,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:28:49,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094405612] [2021-12-14 19:28:49,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:49,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:28:49,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:49,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:28:49,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:28:49,602 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2021-12-14 19:28:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:49,689 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2021-12-14 19:28:49,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:28:49,689 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 19 [2021-12-14 19:28:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:49,690 INFO L225 Difference]: With dead ends: 149 [2021-12-14 19:28:49,690 INFO L226 Difference]: Without dead ends: 149 [2021-12-14 19:28:49,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:28:49,691 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:49,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 541 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:28:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-14 19:28:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2021-12-14 19:28:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 115 states have (on average 1.4) internal successors, (161), 146 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:28:49,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2021-12-14 19:28:49,694 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 19 [2021-12-14 19:28:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:49,694 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2021-12-14 19:28:49,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2021-12-14 19:28:49,694 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2021-12-14 19:28:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-14 19:28:49,695 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:49,695 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:49,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-14 19:28:49,695 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:49,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash 73317399, now seen corresponding path program 1 times [2021-12-14 19:28:49,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:49,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358513552] [2021-12-14 19:28:49,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:49,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:49,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:49,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358513552] [2021-12-14 19:28:49,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358513552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:49,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:49,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:28:49,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513406426] [2021-12-14 19:28:49,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:49,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:28:49,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:49,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:28:49,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:28:49,743 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-12-14 19:28:49,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:49,832 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2021-12-14 19:28:49,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:28:49,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2021-12-14 19:28:49,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:49,833 INFO L225 Difference]: With dead ends: 156 [2021-12-14 19:28:49,833 INFO L226 Difference]: Without dead ends: 156 [2021-12-14 19:28:49,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-14 19:28:49,834 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 8 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:49,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 572 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:28:49,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-14 19:28:49,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2021-12-14 19:28:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 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) [2021-12-14 19:28:49,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-12-14 19:28:49,837 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 20 [2021-12-14 19:28:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:49,837 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-12-14 19:28:49,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2021-12-14 19:28:49,838 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-12-14 19:28:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:28:49,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:49,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:49,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-14 19:28:49,839 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash -800612379, now seen corresponding path program 1 times [2021-12-14 19:28:49,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:49,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638885349] [2021-12-14 19:28:49,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:49,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:49,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:49,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:49,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638885349] [2021-12-14 19:28:49,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638885349] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:49,870 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:49,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:28:49,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54467009] [2021-12-14 19:28:49,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:49,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:28:49,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:49,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:28:49,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:28:49,872 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-12-14 19:28:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:49,938 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2021-12-14 19:28:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:28:49,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2021-12-14 19:28:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:49,939 INFO L225 Difference]: With dead ends: 152 [2021-12-14 19:28:49,939 INFO L226 Difference]: Without dead ends: 152 [2021-12-14 19:28:49,939 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:28:49,940 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:49,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:28:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-14 19:28:49,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-12-14 19:28:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.375) internal successors, (165), 151 states have internal predecessors, (165), 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) [2021-12-14 19:28:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2021-12-14 19:28:49,943 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 22 [2021-12-14 19:28:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:49,943 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2021-12-14 19:28:49,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-12-14 19:28:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2021-12-14 19:28:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-14 19:28:49,944 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:49,944 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:49,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-14 19:28:49,944 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1089542561, now seen corresponding path program 1 times [2021-12-14 19:28:49,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:49,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617699039] [2021-12-14 19:28:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:49,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:49,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:49,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617699039] [2021-12-14 19:28:49,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617699039] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:28:49,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634490135] [2021-12-14 19:28:49,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:49,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:28:49,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:28:49,989 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) [2021-12-14 19:28:50,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-14 19:28:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:50,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 19:28:50,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:28:50,271 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:28:50,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:28:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:50,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:28:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:50,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634490135] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:28:50,446 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:28:50,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2021-12-14 19:28:50,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798863731] [2021-12-14 19:28:50,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:28:50,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-14 19:28:50,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:50,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-14 19:28:50,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:28:50,447 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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) [2021-12-14 19:28:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:50,730 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2021-12-14 19:28:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:28:50,731 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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 25 [2021-12-14 19:28:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:50,733 INFO L225 Difference]: With dead ends: 181 [2021-12-14 19:28:50,733 INFO L226 Difference]: Without dead ends: 181 [2021-12-14 19:28:50,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-12-14 19:28:50,734 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 155 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:50,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 712 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:28:50,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-14 19:28:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2021-12-14 19:28:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 130 states have (on average 1.353846153846154) internal successors, (176), 161 states have internal predecessors, (176), 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) [2021-12-14 19:28:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2021-12-14 19:28:50,737 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 25 [2021-12-14 19:28:50,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:50,738 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2021-12-14 19:28:50,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 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) [2021-12-14 19:28:50,738 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2021-12-14 19:28:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-14 19:28:50,740 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:50,740 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:28:50,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:28:50,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-14 19:28:50,958 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:50,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:50,958 INFO L85 PathProgramCache]: Analyzing trace with hash 583917852, now seen corresponding path program 1 times [2021-12-14 19:28:50,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:50,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305315571] [2021-12-14 19:28:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:50,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:51,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:51,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:51,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305315571] [2021-12-14 19:28:51,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305315571] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:28:51,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701242501] [2021-12-14 19:28:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:51,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:28:51,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:28:51,069 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) [2021-12-14 19:28:51,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-14 19:28:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:51,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:28:51,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:28:51,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2021-12-14 19:28:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:51,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:28:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:51,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701242501] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:28:51,480 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:28:51,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2021-12-14 19:28:51,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849173724] [2021-12-14 19:28:51,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:28:51,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:28:51,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:51,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:28:51,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:28:51,483 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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) [2021-12-14 19:28:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:51,617 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2021-12-14 19:28:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:28:51,618 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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 26 [2021-12-14 19:28:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:51,618 INFO L225 Difference]: With dead ends: 172 [2021-12-14 19:28:51,619 INFO L226 Difference]: Without dead ends: 153 [2021-12-14 19:28:51,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:28:51,620 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 20 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:51,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 470 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2021-12-14 19:28:51,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-14 19:28:51,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-12-14 19:28:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.371900826446281) internal successors, (166), 152 states have internal predecessors, (166), 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) [2021-12-14 19:28:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2021-12-14 19:28:51,623 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 26 [2021-12-14 19:28:51,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:51,623 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2021-12-14 19:28:51,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 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) [2021-12-14 19:28:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2021-12-14 19:28:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-14 19:28:51,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:51,626 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:51,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-14 19:28:51,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-14 19:28:51,845 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:51,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:51,845 INFO L85 PathProgramCache]: Analyzing trace with hash -370767273, now seen corresponding path program 1 times [2021-12-14 19:28:51,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:51,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743596679] [2021-12-14 19:28:51,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:51,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:52,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:52,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743596679] [2021-12-14 19:28:52,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743596679] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:28:52,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181728884] [2021-12-14 19:28:52,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:52,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:28:52,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:28:52,026 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) [2021-12-14 19:28:52,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-14 19:28:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:52,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-14 19:28:52,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:28:52,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:28:52,241 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:28:52,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:28:52,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:28:52,374 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:28:52,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-14 19:28:52,408 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:28:52,408 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-14 19:28:52,503 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-14 19:28:52,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:52,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:28:52,538 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-14 19:28:52,548 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-14 19:28:52,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_305) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2021-12-14 19:28:52,563 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:28:52,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2021-12-14 19:28:52,570 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:28:52,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2021-12-14 19:28:52,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-14 19:28:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:52,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181728884] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:28:52,699 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:28:52,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2021-12-14 19:28:52,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796277949] [2021-12-14 19:28:52,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:28:52,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-14 19:28:52,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-14 19:28:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=363, Unknown=3, NotChecked=120, Total=552 [2021-12-14 19:28:52,702 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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) [2021-12-14 19:28:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:53,290 INFO L93 Difference]: Finished difference Result 281 states and 308 transitions. [2021-12-14 19:28:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-14 19:28:53,290 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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 29 [2021-12-14 19:28:53,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:53,291 INFO L225 Difference]: With dead ends: 281 [2021-12-14 19:28:53,291 INFO L226 Difference]: Without dead ends: 281 [2021-12-14 19:28:53,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=749, Unknown=3, NotChecked=180, Total=1122 [2021-12-14 19:28:53,292 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 656 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 543 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:53,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 1253 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 859 Invalid, 0 Unknown, 543 Unchecked, 0.3s Time] [2021-12-14 19:28:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-12-14 19:28:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 168. [2021-12-14 19:28:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 167 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:28:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2021-12-14 19:28:53,295 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 29 [2021-12-14 19:28:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:53,295 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2021-12-14 19:28:53,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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) [2021-12-14 19:28:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2021-12-14 19:28:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-14 19:28:53,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:53,296 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:53,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-14 19:28:53,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:28:53,512 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:53,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:53,513 INFO L85 PathProgramCache]: Analyzing trace with hash -751968760, now seen corresponding path program 1 times [2021-12-14 19:28:53,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:53,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462747888] [2021-12-14 19:28:53,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:53,513 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:53,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:53,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462747888] [2021-12-14 19:28:53,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462747888] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:28:53,535 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:28:53,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:28:53,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291049970] [2021-12-14 19:28:53,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:28:53,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:28:53,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:53,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:28:53,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:28:53,536 INFO L87 Difference]: Start difference. First operand 168 states and 183 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2021-12-14 19:28:53,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:53,553 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2021-12-14 19:28:53,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:28:53,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2021-12-14 19:28:53,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:53,554 INFO L225 Difference]: With dead ends: 239 [2021-12-14 19:28:53,554 INFO L226 Difference]: Without dead ends: 239 [2021-12-14 19:28:53,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:28:53,555 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 55 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:53,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 245 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:28:53,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-14 19:28:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 186. [2021-12-14 19:28:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 154 states have (on average 1.3051948051948052) internal successors, (201), 185 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:28:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2021-12-14 19:28:53,558 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 30 [2021-12-14 19:28:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:53,558 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2021-12-14 19:28:53,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2021-12-14 19:28:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2021-12-14 19:28:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:28:53,559 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:53,559 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:53,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-14 19:28:53,560 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:53,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:53,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046208, now seen corresponding path program 1 times [2021-12-14 19:28:53,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:53,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574981864] [2021-12-14 19:28:53,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:53,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:53,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:53,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574981864] [2021-12-14 19:28:53,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574981864] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:28:53,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267589176] [2021-12-14 19:28:53,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:53,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:28:53,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:28:53,700 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) [2021-12-14 19:28:53,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-14 19:28:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:53,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-14 19:28:53,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:28:53,773 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:28:53,838 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:28:53,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:28:53,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:28:53,973 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:28:53,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 19:28:54,002 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:28:54,002 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:28:54,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:28:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:54,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:28:54,342 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_413 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_413) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2021-12-14 19:28:54,350 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:28:54,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-14 19:28:54,355 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:28:54,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-14 19:28:54,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-14 19:28:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:56,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267589176] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:28:56,708 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:28:56,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2021-12-14 19:28:56,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352918271] [2021-12-14 19:28:56,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:28:56,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-14 19:28:56,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:56,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-14 19:28:56,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=659, Unknown=11, NotChecked=54, Total=870 [2021-12-14 19:28:56,709 INFO L87 Difference]: Start difference. First operand 186 states and 201 transitions. Second operand has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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) [2021-12-14 19:28:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:28:57,280 INFO L93 Difference]: Finished difference Result 301 states and 327 transitions. [2021-12-14 19:28:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-14 19:28:57,281 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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 39 [2021-12-14 19:28:57,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:28:57,282 INFO L225 Difference]: With dead ends: 301 [2021-12-14 19:28:57,282 INFO L226 Difference]: Without dead ends: 301 [2021-12-14 19:28:57,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=313, Invalid=1240, Unknown=11, NotChecked=76, Total=1640 [2021-12-14 19:28:57,283 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 283 mSDsluCounter, 2032 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2186 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 749 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:28:57,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 2186 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 873 Invalid, 0 Unknown, 749 Unchecked, 0.3s Time] [2021-12-14 19:28:57,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-14 19:28:57,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 197. [2021-12-14 19:28:57,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 165 states have (on average 1.309090909090909) internal successors, (216), 196 states have internal predecessors, (216), 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) [2021-12-14 19:28:57,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 216 transitions. [2021-12-14 19:28:57,286 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 216 transitions. Word has length 39 [2021-12-14 19:28:57,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:28:57,286 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 216 transitions. [2021-12-14 19:28:57,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 30 states have internal predecessors, (114), 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) [2021-12-14 19:28:57,286 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 216 transitions. [2021-12-14 19:28:57,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-14 19:28:57,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:28:57,287 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:28:57,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:28:57,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-14 19:28:57,499 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:28:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:28:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046209, now seen corresponding path program 1 times [2021-12-14 19:28:57,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:28:57,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829821565] [2021-12-14 19:28:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:57,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:28:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:57,725 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:28:57,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829821565] [2021-12-14 19:28:57,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829821565] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:28:57,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28253762] [2021-12-14 19:28:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:28:57,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:28:57,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:28:57,727 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) [2021-12-14 19:28:57,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-14 19:28:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:28:57,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-14 19:28:57,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:28:57,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:28:57,884 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:28:57,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:28:57,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:28:57,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:28:57,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:28:58,021 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:28:58,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 19:28:58,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 19:28:58,034 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:28:58,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 19:28:58,070 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:28:58,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:28:58,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:28:58,212 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:28:58,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:28:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:58,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:28:58,402 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-14 19:28:58,419 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-14 19:28:58,426 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_490) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)))) is different from false [2021-12-14 19:28:58,438 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:28:58,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-14 19:28:58,444 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:28:58,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-14 19:28:58,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-14 19:28:58,476 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:28:58,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-14 19:28:58,481 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:28:58,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-14 19:28:58,483 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:28:58,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-14 19:28:58,486 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:28:58,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-14 19:28:58,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:28:58,591 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28253762] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:28:58,591 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:28:58,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 31 [2021-12-14 19:28:58,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597613116] [2021-12-14 19:28:58,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:28:58,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-14 19:28:58,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:28:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-14 19:28:58,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2021-12-14 19:28:58,593 INFO L87 Difference]: Start difference. First operand 197 states and 216 transitions. Second operand has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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) [2021-12-14 19:29:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:00,068 INFO L93 Difference]: Finished difference Result 326 states and 351 transitions. [2021-12-14 19:29:00,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-12-14 19:29:00,069 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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 39 [2021-12-14 19:29:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:00,070 INFO L225 Difference]: With dead ends: 326 [2021-12-14 19:29:00,070 INFO L226 Difference]: Without dead ends: 326 [2021-12-14 19:29:00,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=490, Invalid=2381, Unknown=3, NotChecked=318, Total=3192 [2021-12-14 19:29:00,071 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 635 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 2420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 995 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:00,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [635 Valid, 1199 Invalid, 2420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1299 Invalid, 0 Unknown, 995 Unchecked, 0.6s Time] [2021-12-14 19:29:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-12-14 19:29:00,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 204. [2021-12-14 19:29:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 172 states have (on average 1.308139534883721) internal successors, (225), 203 states have internal predecessors, (225), 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) [2021-12-14 19:29:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2021-12-14 19:29:00,074 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 39 [2021-12-14 19:29:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:00,074 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2021-12-14 19:29:00,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.7096774193548385) internal successors, (115), 32 states have internal predecessors, (115), 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) [2021-12-14 19:29:00,075 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2021-12-14 19:29:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 19:29:00,075 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:00,075 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:00,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:00,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-14 19:29:00,291 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1519790839, now seen corresponding path program 1 times [2021-12-14 19:29:00,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:00,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885582164] [2021-12-14 19:29:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:00,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:29:00,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:00,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885582164] [2021-12-14 19:29:00,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885582164] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:00,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:00,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:00,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618186464] [2021-12-14 19:29:00,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:00,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:00,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:00,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:00,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:00,317 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2021-12-14 19:29:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:00,321 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2021-12-14 19:29:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:00,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 40 [2021-12-14 19:29:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:00,322 INFO L225 Difference]: With dead ends: 204 [2021-12-14 19:29:00,322 INFO L226 Difference]: Without dead ends: 204 [2021-12-14 19:29:00,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:00,323 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:00,323 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 262 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-14 19:29:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2021-12-14 19:29:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 172 states have (on average 1.2965116279069768) internal successors, (223), 203 states have internal predecessors, (223), 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) [2021-12-14 19:29:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 223 transitions. [2021-12-14 19:29:00,326 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 223 transitions. Word has length 40 [2021-12-14 19:29:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:00,326 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 223 transitions. [2021-12-14 19:29:00,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2021-12-14 19:29:00,327 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 223 transitions. [2021-12-14 19:29:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:29:00,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:00,327 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:00,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-14 19:29:00,327 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash -131119790, now seen corresponding path program 1 times [2021-12-14 19:29:00,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:00,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256117445] [2021-12-14 19:29:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:00,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:00,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:00,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256117445] [2021-12-14 19:29:00,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256117445] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:00,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:00,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:29:00,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302917132] [2021-12-14 19:29:00,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:00,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:29:00,351 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:00,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:29:00,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:29:00,352 INFO L87 Difference]: Start difference. First operand 204 states and 223 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2021-12-14 19:29:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:00,380 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2021-12-14 19:29:00,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:29:00,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2021-12-14 19:29:00,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:00,382 INFO L225 Difference]: With dead ends: 250 [2021-12-14 19:29:00,382 INFO L226 Difference]: Without dead ends: 250 [2021-12-14 19:29:00,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:29:00,382 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 45 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:00,382 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 375 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-12-14 19:29:00,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 216. [2021-12-14 19:29:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.3043478260869565) internal successors, (240), 215 states have internal predecessors, (240), 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) [2021-12-14 19:29:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 240 transitions. [2021-12-14 19:29:00,385 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 240 transitions. Word has length 41 [2021-12-14 19:29:00,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:00,386 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 240 transitions. [2021-12-14 19:29:00,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2021-12-14 19:29:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 240 transitions. [2021-12-14 19:29:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:29:00,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:00,386 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:00,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-14 19:29:00,387 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:00,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash 231761564, now seen corresponding path program 1 times [2021-12-14 19:29:00,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:00,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582123710] [2021-12-14 19:29:00,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:00,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:00,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:00,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582123710] [2021-12-14 19:29:00,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582123710] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:00,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901508083] [2021-12-14 19:29:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:00,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:00,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:00,720 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) [2021-12-14 19:29:00,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-14 19:29:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:00,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-14 19:29:00,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:00,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:00,858 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:29:00,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:29:00,862 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:00,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:00,910 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:01,032 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:01,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 19:29:01,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:01,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:29:01,113 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:01,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 63 [2021-12-14 19:29:01,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-14 19:29:01,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:29:01,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-14 19:29:01,403 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-12-14 19:29:01,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:01,528 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:29:01,529 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:01,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2021-12-14 19:29:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:01,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:01,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2021-12-14 19:29:01,938 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:01,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 19:29:01,944 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:01,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-14 19:29:01,949 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-14 19:29:01,969 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:01,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-14 19:29:01,972 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:29:01,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:01,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:01,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-14 19:29:01,986 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:01,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 19:29:01,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:29:01,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:01,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:01,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-14 19:29:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:02,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901508083] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:02,092 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:02,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 37 [2021-12-14 19:29:02,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185698743] [2021-12-14 19:29:02,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:02,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-14 19:29:02,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:02,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-14 19:29:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2021-12-14 19:29:02,094 INFO L87 Difference]: Start difference. First operand 216 states and 240 transitions. Second operand has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:29:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:03,255 INFO L93 Difference]: Finished difference Result 329 states and 358 transitions. [2021-12-14 19:29:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-14 19:29:03,256 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-12-14 19:29:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:03,257 INFO L225 Difference]: With dead ends: 329 [2021-12-14 19:29:03,257 INFO L226 Difference]: Without dead ends: 329 [2021-12-14 19:29:03,258 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=394, Invalid=2798, Unknown=0, NotChecked=0, Total=3192 [2021-12-14 19:29:03,258 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 497 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:03,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 2081 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1118 Invalid, 0 Unknown, 728 Unchecked, 0.5s Time] [2021-12-14 19:29:03,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-12-14 19:29:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 216. [2021-12-14 19:29:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 184 states have (on average 1.298913043478261) internal successors, (239), 215 states have internal predecessors, (239), 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) [2021-12-14 19:29:03,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 239 transitions. [2021-12-14 19:29:03,261 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 239 transitions. Word has length 42 [2021-12-14 19:29:03,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:03,262 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 239 transitions. [2021-12-14 19:29:03,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.135135135135135) internal successors, (116), 37 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:29:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 239 transitions. [2021-12-14 19:29:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 19:29:03,262 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:03,262 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:03,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-14 19:29:03,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:03,463 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:03,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995560, now seen corresponding path program 1 times [2021-12-14 19:29:03,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:03,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658273616] [2021-12-14 19:29:03,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:03,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:03,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:03,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:03,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658273616] [2021-12-14 19:29:03,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658273616] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:03,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333853092] [2021-12-14 19:29:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:03,595 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:03,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:03,596 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) [2021-12-14 19:29:03,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-14 19:29:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:03,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-14 19:29:03,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:03,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:03,748 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-14 19:29:03,749 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-14 19:29:03,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:03,908 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:03,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 19:29:03,933 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:03,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-14 19:29:04,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:29:04,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-12-14 19:29:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:04,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:04,321 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_715 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_715 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2021-12-14 19:29:04,339 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_715 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_715 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2021-12-14 19:29:04,346 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_715 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (forall ((v_ArrVal_715 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2021-12-14 19:29:04,356 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:04,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2021-12-14 19:29:04,363 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:04,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2021-12-14 19:29:04,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2021-12-14 19:29:04,386 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:04,386 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2021-12-14 19:29:04,391 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:04,391 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2021-12-14 19:29:04,393 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-14 19:29:04,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:04,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333853092] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:04,510 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:04,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2021-12-14 19:29:04,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224135522] [2021-12-14 19:29:04,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:04,510 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-14 19:29:04,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-14 19:29:04,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=539, Unknown=3, NotChecked=150, Total=812 [2021-12-14 19:29:04,511 INFO L87 Difference]: Start difference. First operand 216 states and 239 transitions. Second operand has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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) [2021-12-14 19:29:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:04,983 INFO L93 Difference]: Finished difference Result 259 states and 284 transitions. [2021-12-14 19:29:04,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-14 19:29:04,983 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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 44 [2021-12-14 19:29:04,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:04,984 INFO L225 Difference]: With dead ends: 259 [2021-12-14 19:29:04,984 INFO L226 Difference]: Without dead ends: 259 [2021-12-14 19:29:04,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=753, Unknown=3, NotChecked=180, Total=1122 [2021-12-14 19:29:04,985 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 247 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 626 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:04,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 1257 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 881 Invalid, 0 Unknown, 626 Unchecked, 0.3s Time] [2021-12-14 19:29:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-12-14 19:29:04,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 236. [2021-12-14 19:29:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 204 states have (on average 1.3088235294117647) internal successors, (267), 235 states have internal predecessors, (267), 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) [2021-12-14 19:29:04,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 267 transitions. [2021-12-14 19:29:04,988 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 267 transitions. Word has length 44 [2021-12-14 19:29:04,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:04,988 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 267 transitions. [2021-12-14 19:29:04,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.642857142857143) internal successors, (102), 29 states have internal predecessors, (102), 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) [2021-12-14 19:29:04,988 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 267 transitions. [2021-12-14 19:29:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 19:29:04,989 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:04,989 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:05,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:05,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:05,189 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:05,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:05,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995559, now seen corresponding path program 1 times [2021-12-14 19:29:05,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:05,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984718360] [2021-12-14 19:29:05,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:05,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:05,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:05,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984718360] [2021-12-14 19:29:05,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984718360] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:05,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418363825] [2021-12-14 19:29:05,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:05,312 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:05,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:05,317 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) [2021-12-14 19:29:05,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-14 19:29:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:05,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-14 19:29:05,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:05,430 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:05,497 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:29:05,497 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:29:05,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:05,533 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:05,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:05,641 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:29:05,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2021-12-14 19:29:05,646 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-12-14 19:29:05,660 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:05,661 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 19:29:05,703 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:05,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:29:05,706 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:29:05,951 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:29:05,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:06,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:06,162 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_795 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_796) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-14 19:29:06,185 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_795 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_795) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_796) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-14 19:29:06,192 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_795 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_795) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_795) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_796) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-14 19:29:06,205 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:06,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 19:29:06,213 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:06,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-14 19:29:06,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-14 19:29:06,240 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:06,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-14 19:29:06,245 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:06,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-14 19:29:06,247 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:29:06,248 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-14 19:29:06,249 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:29:06,250 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-14 19:29:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:06,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418363825] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:06,340 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:06,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 29 [2021-12-14 19:29:06,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064951382] [2021-12-14 19:29:06,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:06,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-14 19:29:06,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:06,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-14 19:29:06,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=618, Unknown=3, NotChecked=156, Total=870 [2021-12-14 19:29:06,343 INFO L87 Difference]: Start difference. First operand 236 states and 267 transitions. Second operand has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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) [2021-12-14 19:29:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:07,094 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2021-12-14 19:29:07,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-14 19:29:07,095 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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 44 [2021-12-14 19:29:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:07,096 INFO L225 Difference]: With dead ends: 258 [2021-12-14 19:29:07,096 INFO L226 Difference]: Without dead ends: 258 [2021-12-14 19:29:07,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=1198, Unknown=3, NotChecked=228, Total=1722 [2021-12-14 19:29:07,096 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 713 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 519 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:07,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 1019 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 844 Invalid, 0 Unknown, 519 Unchecked, 0.4s Time] [2021-12-14 19:29:07,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-14 19:29:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 236. [2021-12-14 19:29:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 204 states have (on average 1.303921568627451) internal successors, (266), 235 states have internal predecessors, (266), 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) [2021-12-14 19:29:07,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 266 transitions. [2021-12-14 19:29:07,100 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 266 transitions. Word has length 44 [2021-12-14 19:29:07,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:07,100 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 266 transitions. [2021-12-14 19:29:07,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.482758620689655) internal successors, (130), 30 states have internal predecessors, (130), 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) [2021-12-14 19:29:07,100 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 266 transitions. [2021-12-14 19:29:07,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-14 19:29:07,100 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:07,100 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:07,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:07,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-12-14 19:29:07,315 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash -64101254, now seen corresponding path program 1 times [2021-12-14 19:29:07,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:07,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384394014] [2021-12-14 19:29:07,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:07,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-14 19:29:07,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:07,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384394014] [2021-12-14 19:29:07,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384394014] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:07,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:07,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:07,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125881524] [2021-12-14 19:29:07,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:07,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:07,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:07,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:07,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:07,356 INFO L87 Difference]: Start difference. First operand 236 states and 266 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2021-12-14 19:29:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:07,369 INFO L93 Difference]: Finished difference Result 310 states and 346 transitions. [2021-12-14 19:29:07,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 44 [2021-12-14 19:29:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:07,370 INFO L225 Difference]: With dead ends: 310 [2021-12-14 19:29:07,370 INFO L226 Difference]: Without dead ends: 310 [2021-12-14 19:29:07,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:07,371 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:07,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 280 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-12-14 19:29:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 255. [2021-12-14 19:29:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 223 states have (on average 1.2825112107623318) internal successors, (286), 254 states have internal predecessors, (286), 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) [2021-12-14 19:29:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 286 transitions. [2021-12-14 19:29:07,375 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 286 transitions. Word has length 44 [2021-12-14 19:29:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:07,375 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 286 transitions. [2021-12-14 19:29:07,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2021-12-14 19:29:07,375 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 286 transitions. [2021-12-14 19:29:07,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 19:29:07,376 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:07,376 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:07,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-14 19:29:07,376 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:07,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2014223229, now seen corresponding path program 1 times [2021-12-14 19:29:07,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:07,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051327808] [2021-12-14 19:29:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:07,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:07,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:29:07,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:07,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051327808] [2021-12-14 19:29:07,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051327808] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:07,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952839024] [2021-12-14 19:29:07,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:07,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:07,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:07,448 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) [2021-12-14 19:29:07,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-14 19:29:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:07,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:29:07,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:07,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-14 19:29:07,604 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-14 19:29:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:29:07,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-14 19:29:07,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952839024] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:07,698 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-14 19:29:07,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2021-12-14 19:29:07,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422645640] [2021-12-14 19:29:07,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:07,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:29:07,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:29:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:29:07,699 INFO L87 Difference]: Start difference. First operand 255 states and 286 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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) [2021-12-14 19:29:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:07,796 INFO L93 Difference]: Finished difference Result 276 states and 301 transitions. [2021-12-14 19:29:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:29:07,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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 45 [2021-12-14 19:29:07,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:07,797 INFO L225 Difference]: With dead ends: 276 [2021-12-14 19:29:07,797 INFO L226 Difference]: Without dead ends: 268 [2021-12-14 19:29:07,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:29:07,798 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 170 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:07,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 519 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:07,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2021-12-14 19:29:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 263. [2021-12-14 19:29:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 231 states have (on average 1.2597402597402598) internal successors, (291), 262 states have internal predecessors, (291), 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) [2021-12-14 19:29:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2021-12-14 19:29:07,801 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 45 [2021-12-14 19:29:07,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:07,802 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2021-12-14 19:29:07,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 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) [2021-12-14 19:29:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2021-12-14 19:29:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 19:29:07,802 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:07,802 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:07,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:08,018 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-14 19:29:08,018 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash 164743237, now seen corresponding path program 1 times [2021-12-14 19:29:08,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-14 19:29:08,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008243511] [2021-12-14 19:29:08,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:08,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-14 19:29:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:08,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-14 19:29:08,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008243511] [2021-12-14 19:29:08,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008243511] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:29:08,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025258224] [2021-12-14 19:29:08,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:08,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:29:08,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:08,292 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) [2021-12-14 19:29:08,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-14 19:29:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:08,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjunts are in the unsatisfiable core [2021-12-14 19:29:08,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:08,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:08,464 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:29:08,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:29:08,494 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:08,599 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:08,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-14 19:29:08,639 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:08,639 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-14 19:29:08,707 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:29:08,707 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-14 19:29:08,738 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-14 19:29:08,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2021-12-14 19:29:08,855 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 19:29:08,855 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2021-12-14 19:29:08,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-14 19:29:08,963 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-14 19:29:08,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2021-12-14 19:29:08,966 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-14 19:29:08,967 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:29:08,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2021-12-14 19:29:08,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068093757] [2021-12-14 19:29:08,967 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:08,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-14 19:29:08,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-14 19:29:08,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-14 19:29:08,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-12-14 19:29:08,968 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 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) [2021-12-14 19:29:08,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 19:29:08,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2021-12-14 19:29:08,972 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:08,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:08,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:09,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-12-14 19:29:09,187 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2192af31 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-14 19:29:09,190 INFO L158 Benchmark]: Toolchain (without parser) took 22185.83ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 101.6MB in the beginning and 78.3MB in the end (delta: 23.3MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2021-12-14 19:29:09,190 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 77.6MB. Free memory was 35.4MB in the beginning and 35.4MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:29:09,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.59ms. Allocated memory is still 138.4MB. Free memory was 101.3MB in the beginning and 101.1MB in the end (delta: 214.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:29:09,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.19ms. Allocated memory is still 138.4MB. Free memory was 101.1MB in the beginning and 99.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:29:09,190 INFO L158 Benchmark]: Boogie Preprocessor took 40.94ms. Allocated memory is still 138.4MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-14 19:29:09,190 INFO L158 Benchmark]: RCFGBuilder took 470.74ms. Allocated memory is still 138.4MB. Free memory was 96.9MB in the beginning and 75.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2021-12-14 19:29:09,191 INFO L158 Benchmark]: TraceAbstraction took 21288.96ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 74.6MB in the beginning and 78.3MB in the end (delta: -3.7MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. [2021-12-14 19:29:09,191 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60ms. Allocated memory is still 77.6MB. Free memory was 35.4MB in the beginning and 35.4MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.59ms. Allocated memory is still 138.4MB. Free memory was 101.3MB in the beginning and 101.1MB in the end (delta: 214.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.19ms. Allocated memory is still 138.4MB. Free memory was 101.1MB in the beginning and 99.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.94ms. Allocated memory is still 138.4MB. Free memory was 99.0MB in the beginning and 96.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 470.74ms. Allocated memory is still 138.4MB. Free memory was 96.9MB in the beginning and 75.4MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 21288.96ms. Allocated memory was 138.4MB in the beginning and 207.6MB in the end (delta: 69.2MB). Free memory was 74.6MB in the beginning and 78.3MB in the end (delta: -3.7MB). Peak memory consumption was 66.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2192af31 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@2192af31: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-14 19:29:09,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 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: /usr/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:29:11,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:29:11,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:29:11,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:29:11,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:29:11,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:29:11,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:29:11,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:29:11,108 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:29:11,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:29:11,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:29:11,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:29:11,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:29:11,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:29:11,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:29:11,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:29:11,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:29:11,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:29:11,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:29:11,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:29:11,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:29:11,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:29:11,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:29:11,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:29:11,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:29:11,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:29:11,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:29:11,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:29:11,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:29:11,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:29:11,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:29:11,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:29:11,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:29:11,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:29:11,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:29:11,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:29:11,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:29:11,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:29:11,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:29:11,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:29:11,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:29:11,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2021-12-14 19:29:11,180 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:29:11,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:29:11,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:29:11,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:29:11,182 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:29:11,182 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:29:11,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:29:11,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:29:11,183 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:29:11,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:29:11,184 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:29:11,184 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:29:11,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:29:11,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:29:11,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:29:11,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:29:11,185 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:29:11,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:29:11,185 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:29:11,185 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:29:11,185 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:29:11,185 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:29:11,185 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:29:11,186 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:29:11,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:29:11,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:29:11,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:29:11,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:29:11,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:29:11,187 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:29:11,187 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:29:11,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:29:11,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:29:11,187 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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.graphml 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 valid-memcleanup) ) 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 -> af4a0e4f738e916feae01fb2c2f056f4ba7834b8a7b8d69765614c5417c16c63 [2021-12-14 19:29:11,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:29:11,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:29:11,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:29:11,482 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:29:11,484 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:29:11,485 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-12-14 19:29:11,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d1deb98/e39f6359aa22449aac8e7d9f0f3df4f3/FLAGdf4fe0f95 [2021-12-14 19:29:11,886 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:29:11,891 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i [2021-12-14 19:29:11,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d1deb98/e39f6359aa22449aac8e7d9f0f3df4f3/FLAGdf4fe0f95 [2021-12-14 19:29:12,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4d1deb98/e39f6359aa22449aac8e7d9f0f3df4f3 [2021-12-14 19:29:12,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:29:12,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:29:12,268 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:29:12,268 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:29:12,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:29:12,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f6aa52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12, skipping insertion in model container [2021-12-14 19:29:12,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,280 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:29:12,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:29:12,556 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2021-12-14 19:29:12,559 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2021-12-14 19:29:12,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2021-12-14 19:29:12,562 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2021-12-14 19:29:12,563 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2021-12-14 19:29:12,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2021-12-14 19:29:12,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2021-12-14 19:29:12,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2021-12-14 19:29:12,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2021-12-14 19:29:12,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2021-12-14 19:29:12,588 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2021-12-14 19:29:12,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2021-12-14 19:29:12,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2021-12-14 19:29:12,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2021-12-14 19:29:12,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:29:12,634 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:29:12,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22387,22400] [2021-12-14 19:29:12,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22458,22471] [2021-12-14 19:29:12,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22532,22545] [2021-12-14 19:29:12,691 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22624,22637] [2021-12-14 19:29:12,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22701,22714] [2021-12-14 19:29:12,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22796,22809] [2021-12-14 19:29:12,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22873,22886] [2021-12-14 19:29:12,698 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[22956,22969] [2021-12-14 19:29:12,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23051,23064] [2021-12-14 19:29:12,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23128,23141] [2021-12-14 19:29:12,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23211,23224] [2021-12-14 19:29:12,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23300,23313] [2021-12-14 19:29:12,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23386,23399] [2021-12-14 19:29:12,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-2.i[23532,23545] [2021-12-14 19:29:12,723 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:29:12,755 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:29:12,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12 WrapperNode [2021-12-14 19:29:12,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:29:12,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:29:12,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:29:12,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:29:12,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,803 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,851 INFO L137 Inliner]: procedures = 122, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2021-12-14 19:29:12,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:29:12,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:29:12,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:29:12,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:29:12,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:29:12,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:29:12,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:29:12,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:29:12,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (1/1) ... [2021-12-14 19:29:12,940 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:29:12,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:29:12,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-14 19:29:13,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-14 19:29:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:29:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:29:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:29:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:29:13,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:29:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:29:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:29:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:29:13,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:29:13,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:29:13,135 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:29:13,149 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:29:13,584 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:29:13,589 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:29:13,589 INFO L301 CfgBuilder]: Removed 31 assume(true) statements. [2021-12-14 19:29:13,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:29:13 BoogieIcfgContainer [2021-12-14 19:29:13,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:29:13,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:29:13,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:29:13,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:29:13,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:29:12" (1/3) ... [2021-12-14 19:29:13,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0345e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:29:13, skipping insertion in model container [2021-12-14 19:29:13,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:12" (2/3) ... [2021-12-14 19:29:13,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e0345e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:29:13, skipping insertion in model container [2021-12-14 19:29:13,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:29:13" (3/3) ... [2021-12-14 19:29:13,595 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-2.i [2021-12-14 19:29:13,600 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:29:13,600 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2021-12-14 19:29:13,643 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:29:13,649 INFO L339 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-14 19:29:13,649 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2021-12-14 19:29:13,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 states have internal predecessors, (222), 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) [2021-12-14 19:29:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:29:13,668 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:13,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:29:13,669 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:13,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-14 19:29:13,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:13,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800850150] [2021-12-14 19:29:13,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:13,682 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:13,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:13,724 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:13,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-14 19:29:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:13,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:29:13,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:13,888 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:13,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:13,914 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:13,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800850150] [2021-12-14 19:29:13,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800850150] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:13,915 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:13,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:29:13,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432638254] [2021-12-14 19:29:13,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:13,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:13,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:13,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:13,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:13,947 INFO L87 Difference]: Start difference. First operand has 168 states, 97 states have (on average 2.288659793814433) internal successors, (222), 167 states have internal predecessors, (222), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-14 19:29:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:14,180 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2021-12-14 19:29:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:14,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-14 19:29:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:14,190 INFO L225 Difference]: With dead ends: 166 [2021-12-14 19:29:14,190 INFO L226 Difference]: Without dead ends: 162 [2021-12-14 19:29:14,195 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:14,198 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 156 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:14,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 105 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:29:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-12-14 19:29:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2021-12-14 19:29:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 98 states have (on average 1.7244897959183674) internal successors, (169), 157 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:29:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2021-12-14 19:29:14,230 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 3 [2021-12-14 19:29:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:14,231 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2021-12-14 19:29:14,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-14 19:29:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2021-12-14 19:29:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-14 19:29:14,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:14,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-14 19:29:14,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-14 19:29:14,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:14,440 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:14,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-14 19:29:14,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:14,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659144536] [2021-12-14 19:29:14,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:14,442 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:14,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:14,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:14,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-14 19:29:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:14,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:29:14,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:14,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:14,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:14,528 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:14,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659144536] [2021-12-14 19:29:14,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659144536] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:14,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:14,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:29:14,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029004640] [2021-12-14 19:29:14,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:14,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:14,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:14,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:14,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:14,531 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-14 19:29:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:14,711 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2021-12-14 19:29:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:14,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-14 19:29:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:14,713 INFO L225 Difference]: With dead ends: 152 [2021-12-14 19:29:14,713 INFO L226 Difference]: Without dead ends: 152 [2021-12-14 19:29:14,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:14,714 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:14,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 108 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:29:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-14 19:29:14,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2021-12-14 19:29:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.6122448979591837) internal successors, (158), 147 states have internal predecessors, (158), 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) [2021-12-14 19:29:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2021-12-14 19:29:14,722 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 3 [2021-12-14 19:29:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:14,722 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2021-12-14 19:29:14,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-14 19:29:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2021-12-14 19:29:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:29:14,722 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:14,722 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:14,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:14,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:14,929 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2021-12-14 19:29:14,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:14,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538441575] [2021-12-14 19:29:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:14,931 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:14,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:14,932 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:14,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-14 19:29:14,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:14,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:29:14,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:14,990 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:15,024 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:29:15,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2021-12-14 19:29:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:15,040 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:15,040 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:15,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538441575] [2021-12-14 19:29:15,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538441575] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:15,040 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:15,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:15,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126601525] [2021-12-14 19:29:15,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:15,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:29:15,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:15,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:29:15,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:29:15,042 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-12-14 19:29:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:15,212 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2021-12-14 19:29:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:29:15,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2021-12-14 19:29:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:15,214 INFO L225 Difference]: With dead ends: 158 [2021-12-14 19:29:15,214 INFO L226 Difference]: Without dead ends: 158 [2021-12-14 19:29:15,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:29:15,215 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 256 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:15,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [256 Valid, 108 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:29:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-12-14 19:29:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2021-12-14 19:29:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.561904761904762) internal successors, (164), 149 states have internal predecessors, (164), 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) [2021-12-14 19:29:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 164 transitions. [2021-12-14 19:29:15,222 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 164 transitions. Word has length 7 [2021-12-14 19:29:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:15,222 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 164 transitions. [2021-12-14 19:29:15,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-12-14 19:29:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 164 transitions. [2021-12-14 19:29:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:29:15,222 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:15,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:15,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:15,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:15,429 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:15,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2021-12-14 19:29:15,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:15,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663476636] [2021-12-14 19:29:15,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:15,430 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:15,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:15,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:15,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-14 19:29:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:15,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:29:15,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:15,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:15,578 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:15,579 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-14 19:29:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:15,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:15,589 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:15,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663476636] [2021-12-14 19:29:15,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663476636] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:15,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:15,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:15,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363772732] [2021-12-14 19:29:15,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:15,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:29:15,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:15,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:29:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:29:15,591 INFO L87 Difference]: Start difference. First operand 150 states and 164 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-12-14 19:29:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:15,895 INFO L93 Difference]: Finished difference Result 240 states and 255 transitions. [2021-12-14 19:29:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:29:15,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2021-12-14 19:29:15,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:15,897 INFO L225 Difference]: With dead ends: 240 [2021-12-14 19:29:15,897 INFO L226 Difference]: Without dead ends: 240 [2021-12-14 19:29:15,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:29:15,898 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 313 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:15,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 175 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:29:15,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2021-12-14 19:29:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 154. [2021-12-14 19:29:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 153 states have internal predecessors, (168), 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) [2021-12-14 19:29:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2021-12-14 19:29:15,905 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 7 [2021-12-14 19:29:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:15,906 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2021-12-14 19:29:15,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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) [2021-12-14 19:29:15,906 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2021-12-14 19:29:15,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-14 19:29:15,911 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:15,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:15,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:16,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:16,118 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:16,119 INFO L85 PathProgramCache]: Analyzing trace with hash 59268142, now seen corresponding path program 1 times [2021-12-14 19:29:16,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:16,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [558179330] [2021-12-14 19:29:16,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:16,119 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:16,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:16,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:16,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-14 19:29:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:16,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:29:16,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:16,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:16,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:16,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:16,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [558179330] [2021-12-14 19:29:16,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [558179330] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:16,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:16,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:16,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365967558] [2021-12-14 19:29:16,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:16,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:16,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:16,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:16,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:16,184 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2021-12-14 19:29:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:16,222 INFO L93 Difference]: Finished difference Result 144 states and 157 transitions. [2021-12-14 19:29:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:16,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2021-12-14 19:29:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:16,224 INFO L225 Difference]: With dead ends: 144 [2021-12-14 19:29:16,224 INFO L226 Difference]: Without dead ends: 144 [2021-12-14 19:29:16,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:16,225 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 122 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:16,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 131 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-12-14 19:29:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-12-14 19:29:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 104 states have (on average 1.5096153846153846) internal successors, (157), 143 states have internal predecessors, (157), 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) [2021-12-14 19:29:16,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 157 transitions. [2021-12-14 19:29:16,230 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 157 transitions. Word has length 8 [2021-12-14 19:29:16,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:16,230 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 157 transitions. [2021-12-14 19:29:16,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2021-12-14 19:29:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 157 transitions. [2021-12-14 19:29:16,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:29:16,231 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:16,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:16,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:16,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:16,462 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:16,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2021-12-14 19:29:16,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:16,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665578587] [2021-12-14 19:29:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:16,463 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:16,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:16,464 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:16,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-14 19:29:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:16,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-14 19:29:16,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:16,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:16,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:16,634 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-14 19:29:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:16,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:16,648 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665578587] [2021-12-14 19:29:16,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665578587] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:16,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:16,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:29:16,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708928598] [2021-12-14 19:29:16,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:16,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:29:16,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:16,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:29:16,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:29:16,652 INFO L87 Difference]: Start difference. First operand 144 states and 157 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2021-12-14 19:29:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:17,026 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2021-12-14 19:29:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:29:17,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2021-12-14 19:29:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:17,028 INFO L225 Difference]: With dead ends: 215 [2021-12-14 19:29:17,028 INFO L226 Difference]: Without dead ends: 215 [2021-12-14 19:29:17,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:29:17,028 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 109 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:17,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 656 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:29:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-12-14 19:29:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 143. [2021-12-14 19:29:17,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.5) internal successors, (156), 142 states have internal predecessors, (156), 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) [2021-12-14 19:29:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2021-12-14 19:29:17,033 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 11 [2021-12-14 19:29:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:17,034 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2021-12-14 19:29:17,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2021-12-14 19:29:17,034 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2021-12-14 19:29:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-14 19:29:17,034 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:17,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:17,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-14 19:29:17,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:17,241 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:17,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:17,241 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2021-12-14 19:29:17,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:17,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153078814] [2021-12-14 19:29:17,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:17,242 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:17,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:17,244 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:17,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-14 19:29:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:17,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:29:17,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:17,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:17,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:17,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:17,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-14 19:29:17,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:17,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:17,391 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:17,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153078814] [2021-12-14 19:29:17,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153078814] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:17,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:17,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:29:17,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934420430] [2021-12-14 19:29:17,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:17,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:29:17,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:29:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:29:17,392 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2021-12-14 19:29:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:17,813 INFO L93 Difference]: Finished difference Result 207 states and 223 transitions. [2021-12-14 19:29:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:29:17,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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 11 [2021-12-14 19:29:17,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:17,814 INFO L225 Difference]: With dead ends: 207 [2021-12-14 19:29:17,814 INFO L226 Difference]: Without dead ends: 207 [2021-12-14 19:29:17,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:29:17,815 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 96 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:17,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 650 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:29:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-14 19:29:17,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 133. [2021-12-14 19:29:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 100 states have (on average 1.45) internal successors, (145), 132 states have internal predecessors, (145), 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) [2021-12-14 19:29:17,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2021-12-14 19:29:17,819 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2021-12-14 19:29:17,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:17,820 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2021-12-14 19:29:17,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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) [2021-12-14 19:29:17,820 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2021-12-14 19:29:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-14 19:29:17,823 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:17,823 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:17,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:18,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:18,030 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:18,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1469737219, now seen corresponding path program 1 times [2021-12-14 19:29:18,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:18,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116813969] [2021-12-14 19:29:18,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:18,031 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:18,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:18,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:18,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-14 19:29:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:18,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:29:18,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:18,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:18,118 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:18,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116813969] [2021-12-14 19:29:18,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116813969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:18,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:18,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:18,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859262520] [2021-12-14 19:29:18,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:18,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:18,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:18,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:18,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:18,120 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-12-14 19:29:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:18,139 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2021-12-14 19:29:18,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:18,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2021-12-14 19:29:18,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:18,140 INFO L225 Difference]: With dead ends: 185 [2021-12-14 19:29:18,140 INFO L226 Difference]: Without dead ends: 185 [2021-12-14 19:29:18,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:18,141 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 44 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:18,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 242 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-14 19:29:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2021-12-14 19:29:18,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 144 states have internal predecessors, (158), 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) [2021-12-14 19:29:18,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 158 transitions. [2021-12-14 19:29:18,146 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 158 transitions. Word has length 14 [2021-12-14 19:29:18,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:18,146 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 158 transitions. [2021-12-14 19:29:18,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2021-12-14 19:29:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 158 transitions. [2021-12-14 19:29:18,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:29:18,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:18,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:18,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-14 19:29:18,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:18,354 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:18,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:18,355 INFO L85 PathProgramCache]: Analyzing trace with hash -529144660, now seen corresponding path program 1 times [2021-12-14 19:29:18,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:18,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356356326] [2021-12-14 19:29:18,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:18,356 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:18,357 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:18,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-14 19:29:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:18,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:29:18,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:18,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:18,457 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:18,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356356326] [2021-12-14 19:29:18,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356356326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:18,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:18,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:29:18,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128854328] [2021-12-14 19:29:18,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:18,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:29:18,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:18,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:29:18,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:29:18,458 INFO L87 Difference]: Start difference. First operand 145 states and 158 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-12-14 19:29:18,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:18,494 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2021-12-14 19:29:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:29:18,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2021-12-14 19:29:18,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:18,495 INFO L225 Difference]: With dead ends: 176 [2021-12-14 19:29:18,495 INFO L226 Difference]: Without dead ends: 176 [2021-12-14 19:29:18,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:29:18,496 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 31 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:18,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 361 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-12-14 19:29:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 154. [2021-12-14 19:29:18,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.396694214876033) internal successors, (169), 153 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:29:18,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2021-12-14 19:29:18,499 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 17 [2021-12-14 19:29:18,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:18,499 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2021-12-14 19:29:18,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2021-12-14 19:29:18,499 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2021-12-14 19:29:18,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-14 19:29:18,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:18,500 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:18,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:18,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:18,706 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:18,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:18,707 INFO L85 PathProgramCache]: Analyzing trace with hash 271532674, now seen corresponding path program 1 times [2021-12-14 19:29:18,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:18,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079549320] [2021-12-14 19:29:18,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:18,707 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:18,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:18,708 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:18,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-14 19:29:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:18,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:29:18,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:18,823 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:18,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-14 19:29:18,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:18,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:18,861 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:18,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079549320] [2021-12-14 19:29:18,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079549320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:18,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:18,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:29:18,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143689468] [2021-12-14 19:29:18,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:18,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:29:18,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:18,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:29:18,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:29:18,863 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2021-12-14 19:29:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:19,046 INFO L93 Difference]: Finished difference Result 152 states and 167 transitions. [2021-12-14 19:29:19,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-14 19:29:19,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2021-12-14 19:29:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:19,047 INFO L225 Difference]: With dead ends: 152 [2021-12-14 19:29:19,048 INFO L226 Difference]: Without dead ends: 152 [2021-12-14 19:29:19,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:29:19,048 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 89 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:19,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 515 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:19,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-14 19:29:19,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-12-14 19:29:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3916666666666666) internal successors, (167), 151 states have internal predecessors, (167), 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) [2021-12-14 19:29:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2021-12-14 19:29:19,051 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 18 [2021-12-14 19:29:19,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:19,051 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2021-12-14 19:29:19,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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) [2021-12-14 19:29:19,051 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2021-12-14 19:29:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:29:19,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:19,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:19,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-14 19:29:19,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:19,258 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:19,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1721073736, now seen corresponding path program 1 times [2021-12-14 19:29:19,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:19,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606745283] [2021-12-14 19:29:19,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:19,259 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:19,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:19,260 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:19,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-14 19:29:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:19,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:29:19,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:19,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:19,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:19,462 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:19,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606745283] [2021-12-14 19:29:19,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606745283] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:19,462 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:19,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:19,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283426493] [2021-12-14 19:29:19,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:19,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:29:19,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:19,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:29:19,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:29:19,463 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2021-12-14 19:29:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:19,605 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2021-12-14 19:29:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:29:19,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2021-12-14 19:29:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:19,607 INFO L225 Difference]: With dead ends: 156 [2021-12-14 19:29:19,607 INFO L226 Difference]: Without dead ends: 156 [2021-12-14 19:29:19,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:29:19,607 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 262 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:19,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 201 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-14 19:29:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2021-12-14 19:29:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 151 states have internal predecessors, (166), 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) [2021-12-14 19:29:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2021-12-14 19:29:19,610 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 19 [2021-12-14 19:29:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:19,610 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2021-12-14 19:29:19,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2021-12-14 19:29:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2021-12-14 19:29:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-14 19:29:19,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:19,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:19,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2021-12-14 19:29:19,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:19,816 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:19,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1701915074, now seen corresponding path program 1 times [2021-12-14 19:29:19,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:19,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366110674] [2021-12-14 19:29:19,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:19,817 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:19,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:19,818 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:19,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-14 19:29:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:19,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:29:19,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:19,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:19,909 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:19,945 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:29:19,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:29:19,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:19,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:29:20,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:20,011 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:20,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:20,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:20,038 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:20,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366110674] [2021-12-14 19:29:20,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366110674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:20,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:20,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:29:20,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990806949] [2021-12-14 19:29:20,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:20,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:29:20,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:20,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:29:20,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:29:20,039 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2021-12-14 19:29:20,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:20,194 INFO L93 Difference]: Finished difference Result 149 states and 160 transitions. [2021-12-14 19:29:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:29:20,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2021-12-14 19:29:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:20,196 INFO L225 Difference]: With dead ends: 149 [2021-12-14 19:29:20,196 INFO L226 Difference]: Without dead ends: 149 [2021-12-14 19:29:20,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:29:20,196 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:20,196 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 438 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-12-14 19:29:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2021-12-14 19:29:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.3771929824561404) internal successors, (157), 145 states have internal predecessors, (157), 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) [2021-12-14 19:29:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2021-12-14 19:29:20,198 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 19 [2021-12-14 19:29:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:20,199 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2021-12-14 19:29:20,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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) [2021-12-14 19:29:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2021-12-14 19:29:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:29:20,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:20,199 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:20,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:20,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:20,400 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:20,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash 812348068, now seen corresponding path program 1 times [2021-12-14 19:29:20,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:20,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521807042] [2021-12-14 19:29:20,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:20,400 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:20,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:20,401 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:20,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-14 19:29:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:20,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:29:20,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:20,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:20,471 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:20,497 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-14 19:29:20,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:29:20,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:20,504 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-14 19:29:20,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:20,570 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:20,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:20,694 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:20,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521807042] [2021-12-14 19:29:20,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521807042] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:20,695 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:29:20,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2021-12-14 19:29:20,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50109964] [2021-12-14 19:29:20,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:20,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:29:20,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:20,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:29:20,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:29:20,695 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-12-14 19:29:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:20,823 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2021-12-14 19:29:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:29:20,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2021-12-14 19:29:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:20,824 INFO L225 Difference]: With dead ends: 153 [2021-12-14 19:29:20,824 INFO L226 Difference]: Without dead ends: 153 [2021-12-14 19:29:20,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:29:20,825 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:20,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 443 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2021-12-14 19:29:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2021-12-14 19:29:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 121 states have (on average 1.3553719008264462) internal successors, (164), 152 states have internal predecessors, (164), 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) [2021-12-14 19:29:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2021-12-14 19:29:20,829 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 22 [2021-12-14 19:29:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:20,829 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2021-12-14 19:29:20,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-12-14 19:29:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2021-12-14 19:29:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-14 19:29:20,829 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:20,830 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:20,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-12-14 19:29:21,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:21,030 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:21,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:21,030 INFO L85 PathProgramCache]: Analyzing trace with hash -587014801, now seen corresponding path program 1 times [2021-12-14 19:29:21,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:21,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954244463] [2021-12-14 19:29:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:21,031 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:21,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:21,032 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:21,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-14 19:29:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:21,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:29:21,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:21,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:21,297 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:21,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954244463] [2021-12-14 19:29:21,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954244463] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:21,297 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:29:21,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-14 19:29:21,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146297063] [2021-12-14 19:29:21,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:21,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:29:21,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:21,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:29:21,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:29:21,298 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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) [2021-12-14 19:29:21,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:21,517 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2021-12-14 19:29:21,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:29:21,518 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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 23 [2021-12-14 19:29:21,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:21,518 INFO L225 Difference]: With dead ends: 155 [2021-12-14 19:29:21,518 INFO L226 Difference]: Without dead ends: 138 [2021-12-14 19:29:21,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:29:21,519 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:21,519 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 445 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2021-12-14 19:29:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-14 19:29:21,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2021-12-14 19:29:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 137 states have internal predecessors, (148), 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) [2021-12-14 19:29:21,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2021-12-14 19:29:21,522 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 23 [2021-12-14 19:29:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:21,522 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2021-12-14 19:29:21,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 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) [2021-12-14 19:29:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2021-12-14 19:29:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:29:21,523 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:21,523 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:21,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:21,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:21,724 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1469175391, now seen corresponding path program 1 times [2021-12-14 19:29:21,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:21,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288678336] [2021-12-14 19:29:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:21,724 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:21,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:21,740 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:21,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-14 19:29:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:21,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:29:21,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:21,904 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:21,938 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:29:21,939 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 19:29:21,965 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:22,042 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:22,042 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-14 19:29:22,065 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:22,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-14 19:29:22,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-14 19:29:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:22,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:22,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-14 19:29:22,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-14 19:29:22,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_287) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-14 19:29:22,232 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:22,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2021-12-14 19:29:22,241 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:22,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2021-12-14 19:29:22,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-14 19:29:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:22,394 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:22,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288678336] [2021-12-14 19:29:22,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288678336] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:22,395 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:29:22,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2021-12-14 19:29:22,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592218112] [2021-12-14 19:29:22,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:22,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 19:29:22,395 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:22,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 19:29:22,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=124, Unknown=3, NotChecked=72, Total=240 [2021-12-14 19:29:22,395 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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) [2021-12-14 19:29:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:22,989 INFO L93 Difference]: Finished difference Result 238 states and 255 transitions. [2021-12-14 19:29:22,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:29:22,989 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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 27 [2021-12-14 19:29:22,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:22,990 INFO L225 Difference]: With dead ends: 238 [2021-12-14 19:29:22,990 INFO L226 Difference]: Without dead ends: 238 [2021-12-14 19:29:22,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=282, Unknown=3, NotChecked=114, Total=506 [2021-12-14 19:29:22,991 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 392 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:22,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 614 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 454 Unchecked, 0.4s Time] [2021-12-14 19:29:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-14 19:29:22,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 152. [2021-12-14 19:29:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 120 states have (on average 1.3666666666666667) internal successors, (164), 151 states have internal predecessors, (164), 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) [2021-12-14 19:29:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2021-12-14 19:29:22,994 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 27 [2021-12-14 19:29:22,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:22,994 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2021-12-14 19:29:22,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 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) [2021-12-14 19:29:22,994 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2021-12-14 19:29:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-14 19:29:22,994 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:22,994 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:23,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-14 19:29:23,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:23,201 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:23,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:23,202 INFO L85 PathProgramCache]: Analyzing trace with hash -442882051, now seen corresponding path program 1 times [2021-12-14 19:29:23,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:23,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077009297] [2021-12-14 19:29:23,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:23,202 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:23,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:23,203 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:23,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-14 19:29:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:23,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:29:23,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:23,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:23,339 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:23,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077009297] [2021-12-14 19:29:23,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077009297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:23,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:23,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:23,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293225704] [2021-12-14 19:29:23,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:23,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:23,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:23,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:23,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:23,340 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2021-12-14 19:29:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:23,357 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2021-12-14 19:29:23,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:23,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2021-12-14 19:29:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:23,358 INFO L225 Difference]: With dead ends: 209 [2021-12-14 19:29:23,358 INFO L226 Difference]: Without dead ends: 209 [2021-12-14 19:29:23,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:23,359 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 52 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:23,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 236 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-14 19:29:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 169. [2021-12-14 19:29:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 137 states have (on average 1.3211678832116789) internal successors, (181), 168 states have internal predecessors, (181), 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) [2021-12-14 19:29:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 181 transitions. [2021-12-14 19:29:23,362 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 181 transitions. Word has length 28 [2021-12-14 19:29:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:23,362 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 181 transitions. [2021-12-14 19:29:23,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2021-12-14 19:29:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 181 transitions. [2021-12-14 19:29:23,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:29:23,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:23,362 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:23,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:23,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:23,569 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:23,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:23,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549191, now seen corresponding path program 1 times [2021-12-14 19:29:23,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:23,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251675625] [2021-12-14 19:29:23,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:23,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:23,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:23,576 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:23,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-14 19:29:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:23,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:29:23,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:23,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:23,729 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:29:23,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 30 [2021-12-14 19:29:23,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:23,857 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:23,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2021-12-14 19:29:23,897 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:23,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2021-12-14 19:29:24,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2021-12-14 19:29:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:24,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:24,181 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (_ bv1 1)))) is different from false [2021-12-14 19:29:24,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (_ bv1 1)))) is different from false [2021-12-14 19:29:24,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_361) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) (_ bv1 1)))) is different from false [2021-12-14 19:29:24,223 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:24,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-14 19:29:24,231 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:24,231 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2021-12-14 19:29:24,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2021-12-14 19:29:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:33,756 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:33,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251675625] [2021-12-14 19:29:33,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [251675625] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:33,756 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:29:33,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2021-12-14 19:29:33,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596133225] [2021-12-14 19:29:33,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:33,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 19:29:33,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:33,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 19:29:33,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=206, Unknown=6, NotChecked=96, Total=380 [2021-12-14 19:29:33,766 INFO L87 Difference]: Start difference. First operand 169 states and 181 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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) [2021-12-14 19:29:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:34,254 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2021-12-14 19:29:34,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:29:34,254 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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 35 [2021-12-14 19:29:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:34,256 INFO L225 Difference]: With dead ends: 216 [2021-12-14 19:29:34,256 INFO L226 Difference]: Without dead ends: 216 [2021-12-14 19:29:34,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=117, Invalid=309, Unknown=6, NotChecked=120, Total=552 [2021-12-14 19:29:34,256 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 244 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 643 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:34,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 1010 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 257 Invalid, 0 Unknown, 643 Unchecked, 0.3s Time] [2021-12-14 19:29:34,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-12-14 19:29:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 179. [2021-12-14 19:29:34,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 147 states have (on average 1.3197278911564625) internal successors, (194), 178 states have internal predecessors, (194), 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) [2021-12-14 19:29:34,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2021-12-14 19:29:34,259 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 35 [2021-12-14 19:29:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:34,259 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2021-12-14 19:29:34,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 20 states have internal predecessors, (69), 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) [2021-12-14 19:29:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2021-12-14 19:29:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-14 19:29:34,260 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:34,260 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:34,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:34,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:34,469 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:34,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:34,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1554549192, now seen corresponding path program 1 times [2021-12-14 19:29:34,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:34,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099743056] [2021-12-14 19:29:34,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:34,470 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:34,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:34,471 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:34,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-14 19:29:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:34,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-14 19:29:34,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:34,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:34,606 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:29:34,607 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-14 19:29:34,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:34,635 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:34,640 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:34,780 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:34,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 19:29:34,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:34,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:29:34,816 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:34,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:29:34,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:29:34,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:29:34,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:35,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:35,333 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-14 19:29:35,379 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-14 19:29:35,402 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_404) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_405 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_405) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2021-12-14 19:29:35,421 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:35,421 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-14 19:29:35,432 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:35,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2021-12-14 19:29:35,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 19:29:35,478 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:35,479 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-14 19:29:35,486 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:35,487 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-14 19:29:35,489 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:29:35,492 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-14 19:29:35,494 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:29:35,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-14 19:29:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:35,617 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:35,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099743056] [2021-12-14 19:29:35,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099743056] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:35,617 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:29:35,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-12-14 19:29:35,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302423926] [2021-12-14 19:29:35,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:35,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 19:29:35,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:35,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 19:29:35,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2021-12-14 19:29:35,618 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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) [2021-12-14 19:29:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:37,368 INFO L93 Difference]: Finished difference Result 303 states and 324 transitions. [2021-12-14 19:29:37,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-14 19:29:37,369 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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 35 [2021-12-14 19:29:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:37,370 INFO L225 Difference]: With dead ends: 303 [2021-12-14 19:29:37,370 INFO L226 Difference]: Without dead ends: 303 [2021-12-14 19:29:37,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=155, Invalid=610, Unknown=3, NotChecked=162, Total=930 [2021-12-14 19:29:37,371 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 395 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 711 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:37,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 636 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 529 Invalid, 0 Unknown, 711 Unchecked, 1.0s Time] [2021-12-14 19:29:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-12-14 19:29:37,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 183. [2021-12-14 19:29:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 151 states have (on average 1.3112582781456954) internal successors, (198), 182 states have internal predecessors, (198), 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) [2021-12-14 19:29:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2021-12-14 19:29:37,374 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 35 [2021-12-14 19:29:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:37,374 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2021-12-14 19:29:37,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 19 states have internal predecessors, (66), 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) [2021-12-14 19:29:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2021-12-14 19:29:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-14 19:29:37,374 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:37,374 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:37,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:37,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:37,582 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:37,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:37,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1057065939, now seen corresponding path program 1 times [2021-12-14 19:29:37,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:37,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246567539] [2021-12-14 19:29:37,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:37,583 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:37,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:37,584 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:37,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-14 19:29:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:37,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-14 19:29:37,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:37,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:37,729 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:29:37,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2021-12-14 19:29:37,758 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:37,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:37,857 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:37,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-14 19:29:37,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:37,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-14 19:29:37,899 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:37,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 51 [2021-12-14 19:29:37,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-14 19:29:37,906 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2021-12-14 19:29:38,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-14 19:29:38,094 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-14 19:29:38,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:38,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:38,327 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2021-12-14 19:29:38,335 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-14 19:29:38,354 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|)) (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem4#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2021-12-14 19:29:38,364 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_449 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_449) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0))) (forall ((v_ArrVal_450 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_450) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|)))) is different from false [2021-12-14 19:29:38,377 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:38,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 19:29:38,384 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:38,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-14 19:29:38,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-14 19:29:38,410 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-14 19:29:38,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2021-12-14 19:29:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:38,513 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:38,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246567539] [2021-12-14 19:29:38,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246567539] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:38,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:29:38,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2021-12-14 19:29:38,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380432322] [2021-12-14 19:29:38,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:38,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-14 19:29:38,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-14 19:29:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=336, Unknown=3, NotChecked=114, Total=506 [2021-12-14 19:29:38,514 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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) [2021-12-14 19:29:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:40,048 INFO L93 Difference]: Finished difference Result 301 states and 324 transitions. [2021-12-14 19:29:40,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-14 19:29:40,048 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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 38 [2021-12-14 19:29:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:40,049 INFO L225 Difference]: With dead ends: 301 [2021-12-14 19:29:40,050 INFO L226 Difference]: Without dead ends: 301 [2021-12-14 19:29:40,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=995, Unknown=3, NotChecked=204, Total=1406 [2021-12-14 19:29:40,050 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 403 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:40,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [403 Valid, 1301 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 857 Invalid, 0 Unknown, 523 Unchecked, 1.0s Time] [2021-12-14 19:29:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2021-12-14 19:29:40,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 182. [2021-12-14 19:29:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 181 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:29:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 196 transitions. [2021-12-14 19:29:40,053 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 196 transitions. Word has length 38 [2021-12-14 19:29:40,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:40,054 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 196 transitions. [2021-12-14 19:29:40,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.1739130434782608) internal successors, (73), 23 states have internal predecessors, (73), 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) [2021-12-14 19:29:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 196 transitions. [2021-12-14 19:29:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 19:29:40,054 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:40,054 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:40,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-14 19:29:40,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:40,262 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:40,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:40,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322345, now seen corresponding path program 1 times [2021-12-14 19:29:40,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:40,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519092778] [2021-12-14 19:29:40,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:40,263 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:40,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:40,264 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:40,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-14 19:29:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:40,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 19:29:40,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:40,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:40,414 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-14 19:29:40,415 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2021-12-14 19:29:40,445 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:40,541 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:40,541 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2021-12-14 19:29:40,581 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:40,581 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-14 19:29:40,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-12-14 19:29:40,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2021-12-14 19:29:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:40,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:40,962 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (_ bv1 1)))) is different from false [2021-12-14 19:29:40,974 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (_ bv1 1)))) is different from false [2021-12-14 19:29:40,981 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (_ BitVec 1))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| v_ArrVal_492) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_491) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) (_ bv1 1)))) is different from false [2021-12-14 19:29:40,991 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:40,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2021-12-14 19:29:40,999 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:40,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 59 [2021-12-14 19:29:41,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-14 19:29:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:46,879 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:46,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519092778] [2021-12-14 19:29:46,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519092778] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:46,879 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:29:46,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-12-14 19:29:46,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32190627] [2021-12-14 19:29:46,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:46,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-14 19:29:46,879 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-14 19:29:46,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=243, Unknown=4, NotChecked=102, Total=420 [2021-12-14 19:29:46,880 INFO L87 Difference]: Start difference. First operand 182 states and 196 transitions. Second operand has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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) [2021-12-14 19:29:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:47,398 INFO L93 Difference]: Finished difference Result 218 states and 235 transitions. [2021-12-14 19:29:47,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:29:47,399 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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 40 [2021-12-14 19:29:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:47,400 INFO L225 Difference]: With dead ends: 218 [2021-12-14 19:29:47,400 INFO L226 Difference]: Without dead ends: 218 [2021-12-14 19:29:47,400 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=106, Invalid=322, Unknown=4, NotChecked=120, Total=552 [2021-12-14 19:29:47,400 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 232 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 887 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:47,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 686 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 0 Unknown, 887 Unchecked, 0.4s Time] [2021-12-14 19:29:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2021-12-14 19:29:47,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 202. [2021-12-14 19:29:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 201 states have internal predecessors, (226), 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) [2021-12-14 19:29:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2021-12-14 19:29:47,403 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 40 [2021-12-14 19:29:47,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:47,403 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2021-12-14 19:29:47,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.7) internal successors, (74), 21 states have internal predecessors, (74), 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) [2021-12-14 19:29:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2021-12-14 19:29:47,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-12-14 19:29:47,404 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:47,404 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:47,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:47,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:47,611 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:47,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:47,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1093322346, now seen corresponding path program 1 times [2021-12-14 19:29:47,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:47,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330441072] [2021-12-14 19:29:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:47,612 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:47,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:47,613 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:47,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-14 19:29:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:47,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-14 19:29:47,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:47,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:47,760 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:29:47,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 19:29:47,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:47,796 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:47,803 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:47,891 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:47,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-14 19:29:47,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:29:47,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:29:47,927 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:29:47,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-14 19:29:47,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-14 19:29:48,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-14 19:29:48,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:48,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:48,557 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2021-12-14 19:29:48,596 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2021-12-14 19:29:48,617 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_536 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_537 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_537) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_536) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2021-12-14 19:29:48,652 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:48,652 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-14 19:29:48,674 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:48,674 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-14 19:29:48,691 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:48,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2021-12-14 19:29:48,728 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:48,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2021-12-14 19:29:48,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2021-12-14 19:29:48,739 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2021-12-14 19:29:49,216 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:49,217 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2021-12-14 19:29:49,230 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:49,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-14 19:29:49,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:29:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:49,971 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:49,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330441072] [2021-12-14 19:29:49,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330441072] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:49,971 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:29:49,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-12-14 19:29:49,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339369624] [2021-12-14 19:29:49,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:49,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-14 19:29:49,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:49,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-14 19:29:49,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=201, Unknown=3, NotChecked=90, Total=342 [2021-12-14 19:29:49,973 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:29:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:51,148 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2021-12-14 19:29:51,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-14 19:29:51,149 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-12-14 19:29:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:51,149 INFO L225 Difference]: With dead ends: 217 [2021-12-14 19:29:51,150 INFO L226 Difference]: Without dead ends: 217 [2021-12-14 19:29:51,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=164, Invalid=495, Unknown=3, NotChecked=150, Total=812 [2021-12-14 19:29:51,150 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 389 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 755 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:51,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 509 Invalid, 1174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 384 Invalid, 0 Unknown, 755 Unchecked, 0.7s Time] [2021-12-14 19:29:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-12-14 19:29:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 202. [2021-12-14 19:29:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 170 states have (on average 1.3235294117647058) internal successors, (225), 201 states have internal predecessors, (225), 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) [2021-12-14 19:29:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 225 transitions. [2021-12-14 19:29:51,153 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 225 transitions. Word has length 40 [2021-12-14 19:29:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:51,153 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 225 transitions. [2021-12-14 19:29:51,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.222222222222222) internal successors, (76), 19 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:29:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 225 transitions. [2021-12-14 19:29:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:29:51,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:51,153 INFO L514 BasicCegarLoop]: 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] [2021-12-14 19:29:51,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:51,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:51,366 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:51,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash -466746806, now seen corresponding path program 1 times [2021-12-14 19:29:51,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:51,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690233067] [2021-12-14 19:29:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:51,367 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:51,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:51,368 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:51,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-14 19:29:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:51,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:29:51,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:51,548 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-14 19:29:51,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-14 19:29:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:29:51,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-14 19:29:51,679 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:51,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690233067] [2021-12-14 19:29:51,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690233067] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:51,679 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:29:51,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-12-14 19:29:51,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290262923] [2021-12-14 19:29:51,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:51,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:29:51,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:51,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:29:51,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-14 19:29:51,680 INFO L87 Difference]: Start difference. First operand 202 states and 225 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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) [2021-12-14 19:29:51,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:51,858 INFO L93 Difference]: Finished difference Result 229 states and 254 transitions. [2021-12-14 19:29:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:29:51,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 41 [2021-12-14 19:29:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:51,861 INFO L225 Difference]: With dead ends: 229 [2021-12-14 19:29:51,861 INFO L226 Difference]: Without dead ends: 229 [2021-12-14 19:29:51,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:29:51,861 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 181 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:51,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 334 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:29:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-14 19:29:51,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 223. [2021-12-14 19:29:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 191 states have (on average 1.324607329842932) internal successors, (253), 222 states have internal predecessors, (253), 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) [2021-12-14 19:29:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 253 transitions. [2021-12-14 19:29:51,864 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 253 transitions. Word has length 41 [2021-12-14 19:29:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:51,864 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 253 transitions. [2021-12-14 19:29:51,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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) [2021-12-14 19:29:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 253 transitions. [2021-12-14 19:29:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-12-14 19:29:51,865 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:51,865 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:51,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:52,072 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:52,072 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1696634608, now seen corresponding path program 1 times [2021-12-14 19:29:52,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:52,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759410502] [2021-12-14 19:29:52,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:52,073 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:52,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:52,074 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:52,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-14 19:29:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:52,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:29:52,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-14 19:29:52,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:29:52,217 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:52,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759410502] [2021-12-14 19:29:52,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759410502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:29:52,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:29:52,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:29:52,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323051889] [2021-12-14 19:29:52,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:29:52,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:29:52,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:52,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:29:52,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:52,218 INFO L87 Difference]: Start difference. First operand 223 states and 253 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2021-12-14 19:29:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:29:52,251 INFO L93 Difference]: Finished difference Result 283 states and 317 transitions. [2021-12-14 19:29:52,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:29:52,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 41 [2021-12-14 19:29:52,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:29:52,252 INFO L225 Difference]: With dead ends: 283 [2021-12-14 19:29:52,253 INFO L226 Difference]: Without dead ends: 283 [2021-12-14 19:29:52,253 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:29:52,253 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 61 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:29:52,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 270 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:29:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-12-14 19:29:52,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 241. [2021-12-14 19:29:52,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 209 states have (on average 1.3014354066985645) internal successors, (272), 240 states have internal predecessors, (272), 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) [2021-12-14 19:29:52,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2021-12-14 19:29:52,256 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 41 [2021-12-14 19:29:52,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:29:52,256 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2021-12-14 19:29:52,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2021-12-14 19:29:52,257 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2021-12-14 19:29:52,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:29:52,257 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:29:52,257 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:29:52,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-14 19:29:52,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:29:52,465 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2021-12-14 19:29:52,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:29:52,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1584201975, now seen corresponding path program 1 times [2021-12-14 19:29:52,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:29:52,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537854456] [2021-12-14 19:29:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:29:52,465 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:29:52,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:29:52,466 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:29:52,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-14 19:29:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:29:52,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-14 19:29:52,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:29:52,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-14 19:29:52,622 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:29:52,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-14 19:29:52,645 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:52,651 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:29:52,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-14 19:29:52,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:29:52,725 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-14 19:29:52,775 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-14 19:29:52,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:52,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:29:52,873 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2021-12-14 19:29:52,882 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) is different from false [2021-12-14 19:29:52,887 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_668) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2021-12-14 19:29:52,896 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:52,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-14 19:29:52,904 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:29:52,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-14 19:29:52,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2021-12-14 19:29:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:29:52,972 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:29:52,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537854456] [2021-12-14 19:29:52,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537854456] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:29:52,972 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:29:52,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-12-14 19:29:52,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131170658] [2021-12-14 19:29:52,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:29:52,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-14 19:29:52,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:29:52,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-14 19:29:52,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=130, Unknown=3, NotChecked=72, Total=240 [2021-12-14 19:29:52,973 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 16 states have internal predecessors, (51), 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)