./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:38:57,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:38:57,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:38:57,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:38:57,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:38:57,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:38:57,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:38:57,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:38:57,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:38:57,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:38:57,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:38:57,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:38:57,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:38:57,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:38:57,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:38:57,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:38:57,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:38:57,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:38:57,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:38:57,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:38:57,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:38:57,284 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:38:57,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:38:57,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:38:57,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:38:57,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:38:57,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:38:57,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:38:57,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:38:57,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:38:57,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:38:57,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:38:57,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:38:57,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:38:57,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:38:57,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:38:57,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:38:57,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:38:57,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:38:57,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:38:57,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:38:57,300 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-14 19:38:57,322 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:38:57,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:38:57,323 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:38:57,323 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:38:57,324 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:38:57,324 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:38:57,324 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:38:57,324 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:38:57,325 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:38:57,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:38:57,325 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:38:57,325 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:38:57,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:38:57,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:38:57,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:38:57,326 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:38:57,326 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:38:57,326 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:38:57,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:38:57,326 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:38:57,326 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:38:57,327 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:38:57,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:38:57,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:38:57,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:38:57,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:38:57,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:38:57,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:38:57,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:38:57,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:38:57,329 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:38:57,329 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2021-12-14 19:38:57,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:38:57,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:38:57,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:38:57,560 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:38:57,560 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:38:57,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2021-12-14 19:38:57,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aae19896/e02b9210c34748b68965df6bf383653a/FLAG67cc0719d [2021-12-14 19:38:57,954 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:38:57,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2021-12-14 19:38:57,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aae19896/e02b9210c34748b68965df6bf383653a/FLAG67cc0719d [2021-12-14 19:38:58,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8aae19896/e02b9210c34748b68965df6bf383653a [2021-12-14 19:38:58,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:38:58,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:38:58,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:38:58,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:38:58,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:38:58,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:38:58" (1/1) ... [2021-12-14 19:38:58,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8b20a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:58, skipping insertion in model container [2021-12-14 19:38:58,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:38:58" (1/1) ... [2021-12-14 19:38:58,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:38:58,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:38:58,594 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:38:58,604 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-14 19:38:58,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6ee3b59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:38:58, skipping insertion in model container [2021-12-14 19:38:58,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:38:58,605 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-14 19:38:58,607 INFO L158 Benchmark]: Toolchain (without parser) took 251.22ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 56.8MB in the beginning and 83.0MB in the end (delta: -26.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:38:58,608 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 88.1MB. Free memory was 44.9MB in the beginning and 44.9MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:38:58,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.78ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 56.8MB in the beginning and 83.0MB in the end (delta: -26.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:38:58,611 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.18ms. Allocated memory is still 88.1MB. Free memory was 44.9MB in the beginning and 44.9MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.78ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 56.8MB in the beginning and 83.0MB in the end (delta: -26.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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/memsafety-ext2/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:39:00,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:39:00,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:39:00,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:39:00,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:39:00,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:39:00,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:39:00,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:39:00,139 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:39:00,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:39:00,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:39:00,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:39:00,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:39:00,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:39:00,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:39:00,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:39:00,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:39:00,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:39:00,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:39:00,164 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:39:00,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:39:00,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:39:00,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:39:00,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:39:00,170 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:39:00,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:39:00,171 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:39:00,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:39:00,172 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:39:00,173 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:39:00,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:39:00,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:39:00,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:39:00,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:39:00,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:39:00,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:39:00,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:39:00,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:39:00,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:39:00,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:39:00,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:39:00,185 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-14 19:39:00,204 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:39:00,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:39:00,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:39:00,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:39:00,206 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:39:00,206 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:39:00,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:39:00,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:39:00,206 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:39:00,207 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:39:00,207 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:39:00,207 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:39:00,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:39:00,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:39:00,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:39:00,210 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:39:00,210 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:39:00,211 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:39:00,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:39:00,211 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:39:00,211 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:39:00,211 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:39:00,212 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:39:00,212 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:39:00,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:39:00,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:39:00,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:39:00,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:39:00,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:39:00,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:39:00,213 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:39:00,213 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:00,213 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:39:00,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:39:00,214 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2021-12-14 19:39:00,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:39:00,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:39:00,518 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:39:00,519 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:39:00,520 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:39:00,521 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2021-12-14 19:39:00,571 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd5417d1/f68a1a67b18a46529e1b1aa70b99437c/FLAG2dcb91ff6 [2021-12-14 19:39:00,994 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:39:00,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2021-12-14 19:39:01,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd5417d1/f68a1a67b18a46529e1b1aa70b99437c/FLAG2dcb91ff6 [2021-12-14 19:39:01,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd5417d1/f68a1a67b18a46529e1b1aa70b99437c [2021-12-14 19:39:01,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:39:01,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:39:01,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:01,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:39:01,389 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:39:01,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:01" (1/1) ... [2021-12-14 19:39:01,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f409e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01, skipping insertion in model container [2021-12-14 19:39:01,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:01" (1/1) ... [2021-12-14 19:39:01,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:39:01,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:39:01,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:01,647 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-14 19:39:01,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:39:01,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:01,697 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:39:01,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:01,759 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:39:01,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01 WrapperNode [2021-12-14 19:39:01,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:01,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:39:01,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:39:01,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:39:01,773 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:39:01" (1/1) ... [2021-12-14 19:39:01,791 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:39:01" (1/1) ... [2021-12-14 19:39:01,809 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2021-12-14 19:39:01,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:39:01,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:39:01,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:39:01,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:39:01,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01" (1/1) ... [2021-12-14 19:39:01,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01" (1/1) ... [2021-12-14 19:39:01,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01" (1/1) ... [2021-12-14 19:39:01,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01" (1/1) ... [2021-12-14 19:39:01,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01" (1/1) ... [2021-12-14 19:39:01,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01" (1/1) ... [2021-12-14 19:39:01,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01" (1/1) ... [2021-12-14 19:39:01,874 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:39:01,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:39:01,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:39:01,875 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:39:01,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01" (1/1) ... [2021-12-14 19:39:01,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:39:01,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:01,910 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:39:01,914 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:39:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:39:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:39:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2021-12-14 19:39:01,957 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2021-12-14 19:39:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:39:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:39:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:39:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:39:01,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:39:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:39:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 19:39:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:39:01,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:39:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:39:02,093 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:39:02,095 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:39:02,715 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:39:02,720 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:39:02,721 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-14 19:39:02,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:02 BoogieIcfgContainer [2021-12-14 19:39:02,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:39:02,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:39:02,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:39:02,728 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:39:02,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:39:01" (1/3) ... [2021-12-14 19:39:02,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd09be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:39:02, skipping insertion in model container [2021-12-14 19:39:02,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:01" (2/3) ... [2021-12-14 19:39:02,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd09be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:39:02, skipping insertion in model container [2021-12-14 19:39:02,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:02" (3/3) ... [2021-12-14 19:39:02,731 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2021-12-14 19:39:02,740 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:39:02,740 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2021-12-14 19:39:02,769 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:39:02,774 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:39:02,774 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2021-12-14 19:39:02,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:39:02,791 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:02,791 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:39:02,792 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:02,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:02,799 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2021-12-14 19:39:02,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:02,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014826841] [2021-12-14 19:39:02,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:02,809 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:02,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:02,811 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:39:02,812 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:39:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:02,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:02,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:02,956 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:39:03,006 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:03,007 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 20 treesize of output 25 [2021-12-14 19:39:03,033 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:39:03,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:03,034 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:03,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014826841] [2021-12-14 19:39:03,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014826841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:03,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:03,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:03,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105879184] [2021-12-14 19:39:03,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:03,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:03,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:03,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:03,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:03,060 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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:39:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:03,324 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2021-12-14 19:39:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:03,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-14 19:39:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:03,336 INFO L225 Difference]: With dead ends: 183 [2021-12-14 19:39:03,336 INFO L226 Difference]: Without dead ends: 181 [2021-12-14 19:39:03,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:39:03,339 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 47 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:03,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 332 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 97 Unchecked, 0.2s Time] [2021-12-14 19:39:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-14 19:39:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-12-14 19:39:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 91 states have (on average 2.065934065934066) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2021-12-14 19:39:03,376 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 4 [2021-12-14 19:39:03,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:03,376 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2021-12-14 19:39:03,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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:39:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2021-12-14 19:39:03,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:39:03,377 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:03,377 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:39:03,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:03,589 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:39:03,589 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:03,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:03,590 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2021-12-14 19:39:03,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:03,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850137192] [2021-12-14 19:39:03,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:03,591 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:03,592 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:39:03,594 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:39:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:03,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:39:03,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:03,656 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:39:03,664 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:39:03,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:03,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2021-12-14 19:39:03,723 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:03,724 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 18 treesize of output 18 [2021-12-14 19:39:03,738 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:39:03,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:03,739 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:03,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850137192] [2021-12-14 19:39:03,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850137192] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:03,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:03,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:03,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751218388] [2021-12-14 19:39:03,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:03,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:03,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:03,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:03,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:03,744 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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:39:04,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:04,247 INFO L93 Difference]: Finished difference Result 198 states and 212 transitions. [2021-12-14 19:39:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:04,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-12-14 19:39:04,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:04,250 INFO L225 Difference]: With dead ends: 198 [2021-12-14 19:39:04,250 INFO L226 Difference]: Without dead ends: 198 [2021-12-14 19:39:04,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:39:04,252 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 30 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:04,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 341 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:39:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-14 19:39:04,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2021-12-14 19:39:04,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 96 states have (on average 2.0416666666666665) internal successors, (196), 182 states have internal predecessors, (196), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 200 transitions. [2021-12-14 19:39:04,273 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 200 transitions. Word has length 4 [2021-12-14 19:39:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:04,274 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 200 transitions. [2021-12-14 19:39:04,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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:39:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 200 transitions. [2021-12-14 19:39:04,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:39:04,275 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:04,275 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:39:04,297 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:39:04,499 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:39:04,499 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:04,500 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2021-12-14 19:39:04,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:04,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013852641] [2021-12-14 19:39:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:04,501 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:04,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:04,502 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:39:04,503 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:39:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:04,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:39:04,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:04,560 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:39:04,566 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:39:04,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:04,567 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:04,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013852641] [2021-12-14 19:39:04,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013852641] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:04,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:04,567 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:04,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438220073] [2021-12-14 19:39:04,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:04,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:04,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:04,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:04,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:04,569 INFO L87 Difference]: Start difference. First operand 186 states and 200 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:39:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:04,793 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2021-12-14 19:39:04,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:04,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-14 19:39:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:04,796 INFO L225 Difference]: With dead ends: 209 [2021-12-14 19:39:04,796 INFO L226 Difference]: Without dead ends: 209 [2021-12-14 19:39:04,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:39:04,797 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 65 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:04,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 230 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:04,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-12-14 19:39:04,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2021-12-14 19:39:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 96 states have (on average 2.0104166666666665) internal successors, (193), 180 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 197 transitions. [2021-12-14 19:39:04,804 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 197 transitions. Word has length 5 [2021-12-14 19:39:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:04,804 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 197 transitions. [2021-12-14 19:39:04,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:39:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 197 transitions. [2021-12-14 19:39:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:39:04,805 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:04,805 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:39:04,813 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:39:05,008 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:39:05,008 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:05,009 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2021-12-14 19:39:05,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:05,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698298903] [2021-12-14 19:39:05,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:05,009 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:05,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:05,010 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:39:05,011 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:39:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:05,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:39:05,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:05,066 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:39:05,076 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:39:05,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:05,076 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:05,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698298903] [2021-12-14 19:39:05,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698298903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:05,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:05,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:05,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56178708] [2021-12-14 19:39:05,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:05,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:05,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:05,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:05,078 INFO L87 Difference]: Start difference. First operand 184 states and 197 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:39:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:05,315 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2021-12-14 19:39:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:05,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-12-14 19:39:05,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:05,317 INFO L225 Difference]: With dead ends: 182 [2021-12-14 19:39:05,317 INFO L226 Difference]: Without dead ends: 182 [2021-12-14 19:39:05,317 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:39:05,318 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:05,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 272 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:05,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-12-14 19:39:05,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-12-14 19:39:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 96 states have (on average 1.9791666666666667) internal successors, (190), 178 states have internal predecessors, (190), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:05,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 194 transitions. [2021-12-14 19:39:05,323 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 194 transitions. Word has length 5 [2021-12-14 19:39:05,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:05,323 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 194 transitions. [2021-12-14 19:39:05,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:39:05,324 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2021-12-14 19:39:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:39:05,324 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:05,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:05,330 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:39:05,530 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:39:05,530 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:05,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1983189561, now seen corresponding path program 1 times [2021-12-14 19:39:05,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:05,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846796504] [2021-12-14 19:39:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:05,531 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:05,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:05,532 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:39:05,533 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:39:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:05,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:05,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:05,597 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:39:05,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:05,598 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:05,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846796504] [2021-12-14 19:39:05,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846796504] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:05,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:05,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:05,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445698399] [2021-12-14 19:39:05,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:05,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:05,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:05,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:05,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:05,600 INFO L87 Difference]: Start difference. First operand 182 states and 194 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:39:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:05,811 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2021-12-14 19:39:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:05,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:39:05,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:05,812 INFO L225 Difference]: With dead ends: 206 [2021-12-14 19:39:05,812 INFO L226 Difference]: Without dead ends: 206 [2021-12-14 19:39:05,812 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:39:05,813 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 54 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:05,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 236 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-14 19:39:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 181. [2021-12-14 19:39:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2021-12-14 19:39:05,818 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 7 [2021-12-14 19:39:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:05,818 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2021-12-14 19:39:05,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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:39:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2021-12-14 19:39:05,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:39:05,819 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:05,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:05,829 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:39:06,026 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:39:06,026 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:06,027 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2021-12-14 19:39:06,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:06,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595023495] [2021-12-14 19:39:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:06,028 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:06,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:06,029 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:39:06,030 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:39:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:06,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:39:06,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:06,099 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:39:06,125 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:06,126 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:39:06,171 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:39:06,176 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:39:06,209 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:39:06,219 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:39:06,236 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:39:06,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:06,237 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:06,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595023495] [2021-12-14 19:39:06,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595023495] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:06,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:06,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:39:06,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357647758] [2021-12-14 19:39:06,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:06,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:06,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:06,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:06,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:06,239 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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:39:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:06,626 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2021-12-14 19:39:06,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:06,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-12-14 19:39:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:06,628 INFO L225 Difference]: With dead ends: 183 [2021-12-14 19:39:06,628 INFO L226 Difference]: Without dead ends: 183 [2021-12-14 19:39:06,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:06,634 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 4 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:06,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 743 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:39:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-14 19:39:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2021-12-14 19:39:06,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2021-12-14 19:39:06,638 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2021-12-14 19:39:06,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:06,638 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2021-12-14 19:39:06,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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:39:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2021-12-14 19:39:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:39:06,639 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:06,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:06,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:06,845 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:39:06,846 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:06,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:06,846 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2021-12-14 19:39:06,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:06,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434308469] [2021-12-14 19:39:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:06,847 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:06,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:06,848 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:39:06,849 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:39:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:06,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:39:06,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:06,929 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:39:06,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:06,930 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:06,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434308469] [2021-12-14 19:39:06,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434308469] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:06,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:06,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:39:06,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896180033] [2021-12-14 19:39:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:06,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:06,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:06,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:06,932 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:06,955 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2021-12-14 19:39:06,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:39:06,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:39:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:06,957 INFO L225 Difference]: With dead ends: 258 [2021-12-14 19:39:06,957 INFO L226 Difference]: Without dead ends: 258 [2021-12-14 19:39:06,957 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:39:06,958 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:06,958 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 545 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:06,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-14 19:39:06,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2021-12-14 19:39:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2021-12-14 19:39:06,962 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2021-12-14 19:39:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:06,962 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2021-12-14 19:39:06,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2021-12-14 19:39:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:39:06,963 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:06,963 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:06,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-14 19:39:07,167 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:39:07,168 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:07,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2021-12-14 19:39:07,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:07,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023019410] [2021-12-14 19:39:07,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:07,169 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:07,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:07,170 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:39:07,171 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:39:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:07,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:39:07,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:07,253 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:07,260 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:07,260 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 1 case distinctions, treesize of input 9 treesize of output 14 [2021-12-14 19:39:07,273 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:39:07,273 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:07,273 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:07,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023019410] [2021-12-14 19:39:07,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023019410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:07,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:07,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:07,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094865275] [2021-12-14 19:39:07,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:07,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:07,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:07,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:07,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:07,275 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:07,278 INFO L93 Difference]: Finished difference Result 221 states and 271 transitions. [2021-12-14 19:39:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:07,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 19:39:07,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:07,279 INFO L225 Difference]: With dead ends: 221 [2021-12-14 19:39:07,279 INFO L226 Difference]: Without dead ends: 221 [2021-12-14 19:39:07,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:39:07,279 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:07,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 99 Unchecked, 0.0s Time] [2021-12-14 19:39:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-14 19:39:07,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2021-12-14 19:39:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 136 states have (on average 1.963235294117647) internal successors, (267), 216 states have internal predecessors, (267), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 271 transitions. [2021-12-14 19:39:07,286 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 271 transitions. Word has length 13 [2021-12-14 19:39:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:07,287 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 271 transitions. [2021-12-14 19:39:07,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 271 transitions. [2021-12-14 19:39:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:39:07,287 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:07,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:07,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:07,496 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:39:07,496 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:07,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2021-12-14 19:39:07,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:07,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803496625] [2021-12-14 19:39:07,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:07,497 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:07,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:07,497 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:39:07,498 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:39:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:07,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:39:07,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:07,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:07,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-14 19:39:07,594 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:39:07,609 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:39:07,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:07,610 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:07,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803496625] [2021-12-14 19:39:07,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803496625] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:07,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:07,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:07,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447135748] [2021-12-14 19:39:07,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:07,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:07,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:07,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:07,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:07,612 INFO L87 Difference]: Start difference. First operand 221 states and 271 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:07,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:07,823 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-12-14 19:39:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:07,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-14 19:39:07,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:07,824 INFO L225 Difference]: With dead ends: 210 [2021-12-14 19:39:07,824 INFO L226 Difference]: Without dead ends: 210 [2021-12-14 19:39:07,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:39:07,825 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 61 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:07,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 200 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-12-14 19:39:07,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2021-12-14 19:39:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 136 states have (on average 1.7720588235294117) internal successors, (241), 203 states have internal predecessors, (241), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 245 transitions. [2021-12-14 19:39:07,828 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 245 transitions. Word has length 13 [2021-12-14 19:39:07,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:07,828 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 245 transitions. [2021-12-14 19:39:07,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 245 transitions. [2021-12-14 19:39:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:39:07,829 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:07,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:07,837 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:39:08,029 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:39:08,029 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:08,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1465867550, now seen corresponding path program 1 times [2021-12-14 19:39:08,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:08,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869274366] [2021-12-14 19:39:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:08,030 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:08,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:08,031 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:39:08,032 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:39:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:08,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:08,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:08,109 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:39:08,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:08,109 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:08,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869274366] [2021-12-14 19:39:08,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869274366] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:08,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:08,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:08,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304383270] [2021-12-14 19:39:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:08,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:08,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:08,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:08,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:08,110 INFO L87 Difference]: Start difference. First operand 208 states and 245 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:08,138 INFO L93 Difference]: Finished difference Result 221 states and 261 transitions. [2021-12-14 19:39:08,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:08,139 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:39:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:08,140 INFO L225 Difference]: With dead ends: 221 [2021-12-14 19:39:08,140 INFO L226 Difference]: Without dead ends: 221 [2021-12-14 19:39:08,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:39:08,141 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 7 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:08,141 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 336 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-12-14 19:39:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 210. [2021-12-14 19:39:08,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 138 states have (on average 1.7608695652173914) internal successors, (243), 205 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:08,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 247 transitions. [2021-12-14 19:39:08,148 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 247 transitions. Word has length 16 [2021-12-14 19:39:08,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:08,148 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 247 transitions. [2021-12-14 19:39:08,149 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 247 transitions. [2021-12-14 19:39:08,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:39:08,149 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:08,149 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:08,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:08,355 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:39:08,355 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:08,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1465867600, now seen corresponding path program 1 times [2021-12-14 19:39:08,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:08,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862436146] [2021-12-14 19:39:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:08,356 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:08,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:08,357 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:39:08,358 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:39:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:08,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:08,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:08,444 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:39:08,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:08,445 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:08,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862436146] [2021-12-14 19:39:08,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862436146] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:08,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:08,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:08,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963484015] [2021-12-14 19:39:08,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:08,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:08,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:08,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:08,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:08,447 INFO L87 Difference]: Start difference. First operand 210 states and 247 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:08,616 INFO L93 Difference]: Finished difference Result 200 states and 225 transitions. [2021-12-14 19:39:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:08,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-12-14 19:39:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:08,618 INFO L225 Difference]: With dead ends: 200 [2021-12-14 19:39:08,618 INFO L226 Difference]: Without dead ends: 200 [2021-12-14 19:39:08,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:39:08,618 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 46 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:08,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 198 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:08,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2021-12-14 19:39:08,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2021-12-14 19:39:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 138 states have (on average 1.5869565217391304) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2021-12-14 19:39:08,621 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 16 [2021-12-14 19:39:08,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:08,622 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2021-12-14 19:39:08,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2021-12-14 19:39:08,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:39:08,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:08,622 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:39:08,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:08,822 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:39:08,823 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:08,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2021-12-14 19:39:08,823 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:08,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123812712] [2021-12-14 19:39:08,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:08,823 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:08,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:08,824 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:39:08,825 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:39:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:08,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:08,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:08,919 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-14 19:39:08,920 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 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-14 19:39:08,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:39:08,956 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 26 treesize of output 14 [2021-12-14 19:39:08,962 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:39:08,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:08,962 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:08,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123812712] [2021-12-14 19:39:08,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123812712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:08,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:08,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:39:08,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766697731] [2021-12-14 19:39:08,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:08,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:39:08,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:39:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:39:08,964 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:09,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:09,304 INFO L93 Difference]: Finished difference Result 203 states and 229 transitions. [2021-12-14 19:39:09,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:39:09,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:39:09,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:09,306 INFO L225 Difference]: With dead ends: 203 [2021-12-14 19:39:09,306 INFO L226 Difference]: Without dead ends: 203 [2021-12-14 19:39:09,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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:39:09,306 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 4 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:09,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 412 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:39:09,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-12-14 19:39:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2021-12-14 19:39:09,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5845070422535212) internal successors, (225), 197 states have internal predecessors, (225), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 229 transitions. [2021-12-14 19:39:09,310 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 229 transitions. Word has length 17 [2021-12-14 19:39:09,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:09,310 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 229 transitions. [2021-12-14 19:39:09,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 229 transitions. [2021-12-14 19:39:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:39:09,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:09,310 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:39:09,328 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:39:09,511 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:39:09,511 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:09,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:09,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2021-12-14 19:39:09,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:09,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694729362] [2021-12-14 19:39:09,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:09,512 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:09,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:09,513 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:39:09,514 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:39:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:09,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:39:09,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:09,614 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:09,614 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:09,630 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 13 treesize of output 9 [2021-12-14 19:39:09,636 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 13 treesize of output 9 [2021-12-14 19:39:09,685 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 9 [2021-12-14 19:39:09,687 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 19 treesize of output 7 [2021-12-14 19:39:09,700 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:39:09,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:09,700 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:09,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694729362] [2021-12-14 19:39:09,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694729362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:09,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:09,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:39:09,700 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92590759] [2021-12-14 19:39:09,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:09,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:09,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:09,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:09,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:09,702 INFO L87 Difference]: Start difference. First operand 202 states and 229 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:10,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:10,129 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2021-12-14 19:39:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:39:10,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:39:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:10,132 INFO L225 Difference]: With dead ends: 204 [2021-12-14 19:39:10,132 INFO L226 Difference]: Without dead ends: 204 [2021-12-14 19:39:10,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:10,133 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 5 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:10,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 414 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:39:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-14 19:39:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2021-12-14 19:39:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 227 transitions. [2021-12-14 19:39:10,136 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 227 transitions. Word has length 17 [2021-12-14 19:39:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:10,136 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 227 transitions. [2021-12-14 19:39:10,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 227 transitions. [2021-12-14 19:39:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:39:10,137 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:10,137 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] [2021-12-14 19:39:10,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:10,341 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:39:10,341 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2021-12-14 19:39:10,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:10,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589451431] [2021-12-14 19:39:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:10,342 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:10,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:10,364 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:39:10,364 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:39:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:10,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:39:10,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:10,495 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:10,498 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 30 treesize of output 32 [2021-12-14 19:39:10,528 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 13 treesize of output 9 [2021-12-14 19:39:10,584 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:10,585 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 37 treesize of output 38 [2021-12-14 19:39:10,612 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 34 treesize of output 16 [2021-12-14 19:39:10,626 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:39:10,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:10,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_228) c_create_data_~data~0.base) .cse0)))))) (_ bv1 1)))) is different from false [2021-12-14 19:39:10,721 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:10,721 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 30 treesize of output 31 [2021-12-14 19:39:10,724 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 52 treesize of output 40 [2021-12-14 19:39:10,726 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 19 treesize of output 15 [2021-12-14 19:39:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-14 19:39:10,788 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:10,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589451431] [2021-12-14 19:39:10,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589451431] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:10,788 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:10,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-12-14 19:39:10,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661577406] [2021-12-14 19:39:10,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:10,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:39:10,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:10,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:39:10,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=4, NotChecked=14, Total=90 [2021-12-14 19:39:10,789 INFO L87 Difference]: Start difference. First operand 202 states and 227 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:11,189 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2021-12-14 19:39:11,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:11,190 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:39:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:11,191 INFO L225 Difference]: With dead ends: 207 [2021-12-14 19:39:11,191 INFO L226 Difference]: Without dead ends: 207 [2021-12-14 19:39:11,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=60, Unknown=5, NotChecked=16, Total=110 [2021-12-14 19:39:11,191 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 29 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:11,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 593 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 249 Unchecked, 0.4s Time] [2021-12-14 19:39:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-14 19:39:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2021-12-14 19:39:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2021-12-14 19:39:11,198 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 22 [2021-12-14 19:39:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:11,198 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions. [2021-12-14 19:39:11,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions. [2021-12-14 19:39:11,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:39:11,199 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:11,199 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] [2021-12-14 19:39:11,215 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:39:11,406 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:39:11,406 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:11,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:11,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2021-12-14 19:39:11,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:11,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620370188] [2021-12-14 19:39:11,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:11,408 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:11,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:11,415 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:39:11,417 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:39:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:11,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 19:39:11,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:11,551 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:11,551 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:11,560 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:39:11,595 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 13 treesize of output 9 [2021-12-14 19:39:11,604 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 13 treesize of output 9 [2021-12-14 19:39:11,713 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:11,713 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 46 treesize of output 45 [2021-12-14 19:39:11,718 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 22 treesize of output 24 [2021-12-14 19:39:11,801 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 31 treesize of output 13 [2021-12-14 19:39:11,805 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 19 treesize of output 7 [2021-12-14 19:39:11,820 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:39:11,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:12,134 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_272) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_272) c_create_data_~data~0.base) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_273) c_create_data_~data~0.base) .cse2)))))) is different from false [2021-12-14 19:39:12,168 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_272) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_272) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_273) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:12,217 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_272) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_273) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_272 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3) v_ArrVal_272) c_create_data_~data~0.base) .cse3)))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2021-12-14 19:39:12,233 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:12,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 45 treesize of output 36 [2021-12-14 19:39:12,236 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 54 treesize of output 36 [2021-12-14 19:39:12,240 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 19 treesize of output 11 [2021-12-14 19:39:12,256 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:12,256 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 45 treesize of output 46 [2021-12-14 19:39:12,265 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:12,265 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 35 treesize of output 36 [2021-12-14 19:39:12,268 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:12,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, 1 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:39:12,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:12,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, 1 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:39:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-14 19:39:12,333 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:12,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620370188] [2021-12-14 19:39:12,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620370188] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:12,333 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:12,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-14 19:39:12,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183481827] [2021-12-14 19:39:12,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:12,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 19:39:12,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:12,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 19:39:12,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2021-12-14 19:39:12,334 INFO L87 Difference]: Start difference. First operand 201 states and 225 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:14,204 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2021-12-14 19:39:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:39:14,205 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:39:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:14,205 INFO L225 Difference]: With dead ends: 213 [2021-12-14 19:39:14,205 INFO L226 Difference]: Without dead ends: 213 [2021-12-14 19:39:14,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2021-12-14 19:39:14,209 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 17 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:14,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 907 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 479 Invalid, 0 Unknown, 244 Unchecked, 1.7s Time] [2021-12-14 19:39:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-14 19:39:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2021-12-14 19:39:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 235 transitions. [2021-12-14 19:39:14,213 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 235 transitions. Word has length 22 [2021-12-14 19:39:14,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:14,214 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 235 transitions. [2021-12-14 19:39:14,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:14,214 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 235 transitions. [2021-12-14 19:39:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:39:14,217 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:14,217 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:14,226 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:39:14,424 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:39:14,424 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:14,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:14,424 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2021-12-14 19:39:14,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:14,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628912028] [2021-12-14 19:39:14,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:39:14,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:14,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:14,426 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:39:14,427 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:39:14,570 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:39:14,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:14,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 19:39:14,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:14,613 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:14,613 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:14,621 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:39:14,644 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 13 treesize of output 9 [2021-12-14 19:39:14,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:39:14,762 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:14,763 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 46 treesize of output 45 [2021-12-14 19:39:14,768 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 22 treesize of output 24 [2021-12-14 19:39:14,883 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:14,884 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 46 treesize of output 45 [2021-12-14 19:39:14,889 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 22 treesize of output 24 [2021-12-14 19:39:14,956 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 31 treesize of output 13 [2021-12-14 19:39:14,960 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 19 treesize of output 7 [2021-12-14 19:39:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:14,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:15,332 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_334) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_335) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_334) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2021-12-14 19:39:15,373 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_334) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_334) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_335) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:15,436 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_334) c_create_data_~data~0.base) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_335) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_334) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-14 19:39:15,493 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_333)) (.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_332) .cse0 v_ArrVal_334) c_create_data_~data~0.base) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_335) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse4 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_332) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_333) c_create_data_~data~0.base) .cse5) v_ArrVal_334) c_create_data_~data~0.base) .cse5)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-14 19:39:15,751 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_332) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_333) c_create_data_~data~0.base) .cse3) v_ArrVal_334)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_333))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_332) .cse5 v_ArrVal_334) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_335) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-14 19:39:15,813 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_333))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_332) .cse1 v_ArrVal_334) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_335) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_333 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_332) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_333) c_create_data_~data~0.base) .cse6) v_ArrVal_334)) c_create_data_~data~0.base) .cse6)))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))) is different from false [2021-12-14 19:39:15,830 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:15,830 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 89 treesize of output 90 [2021-12-14 19:39:15,839 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:15,840 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 79 treesize of output 60 [2021-12-14 19:39:15,844 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 400 treesize of output 334 [2021-12-14 19:39:15,849 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 688 treesize of output 634 [2021-12-14 19:39:15,859 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 630 treesize of output 582 [2021-12-14 19:39:15,863 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 582 treesize of output 566 [2021-12-14 19:39:15,869 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 566 treesize of output 462 [2021-12-14 19:39:15,875 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 462 treesize of output 414 [2021-12-14 19:39:20,745 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,745 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 89 treesize of output 80 [2021-12-14 19:39:20,751 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,751 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 69 treesize of output 60 [2021-12-14 19:39:20,755 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 102 treesize of output 84 [2021-12-14 19:39:20,761 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 286 treesize of output 244 [2021-12-14 19:39:20,764 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 240 treesize of output 200 [2021-12-14 19:39:20,771 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 170 treesize of output 146 [2021-12-14 19:39:20,779 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 146 treesize of output 130 [2021-12-14 19:39:22,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2021-12-14 19:39:22,147 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:22,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628912028] [2021-12-14 19:39:22,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628912028] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:22,148 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:22,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2021-12-14 19:39:22,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461322672] [2021-12-14 19:39:22,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:22,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 19:39:22,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 19:39:22,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2021-12-14 19:39:22,149 INFO L87 Difference]: Start difference. First operand 211 states and 235 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:24,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:24,225 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2021-12-14 19:39:24,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:39:24,226 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:39:24,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:24,227 INFO L225 Difference]: With dead ends: 223 [2021-12-14 19:39:24,227 INFO L226 Difference]: Without dead ends: 223 [2021-12-14 19:39:24,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2021-12-14 19:39:24,228 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 24 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 596 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:24,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 1240 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 519 Invalid, 0 Unknown, 596 Unchecked, 1.7s Time] [2021-12-14 19:39:24,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-14 19:39:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2021-12-14 19:39:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:24,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions. [2021-12-14 19:39:24,232 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 27 [2021-12-14 19:39:24,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:24,232 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions. [2021-12-14 19:39:24,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions. [2021-12-14 19:39:24,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:39:24,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:24,233 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:24,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-14 19:39:24,448 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:39:24,449 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:24,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:24,449 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times [2021-12-14 19:39:24,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:24,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081986335] [2021-12-14 19:39:24,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:39:24,450 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:24,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:24,450 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:39:24,452 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:39:24,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 19:39:24,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:24,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-14 19:39:24,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:24,760 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 24 treesize of output 22 [2021-12-14 19:39:24,772 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 9 treesize of output 11 [2021-12-14 19:39:24,789 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 13 treesize of output 9 [2021-12-14 19:39:24,799 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 13 treesize of output 9 [2021-12-14 19:39:24,912 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:24,912 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 46 treesize of output 45 [2021-12-14 19:39:24,917 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 22 treesize of output 24 [2021-12-14 19:39:25,035 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:25,036 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 46 treesize of output 45 [2021-12-14 19:39:25,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-14 19:39:25,163 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:25,163 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 46 treesize of output 45 [2021-12-14 19:39:25,168 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 22 treesize of output 24 [2021-12-14 19:39:25,251 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 31 treesize of output 13 [2021-12-14 19:39:25,255 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 19 treesize of output 7 [2021-12-14 19:39:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:25,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:25,604 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_413) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_413) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_414) c_create_data_~data~0.base) .cse2)))))) is different from false [2021-12-14 19:39:25,642 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_413) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_413) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_414) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:25,696 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_413) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_413) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_414) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:25,748 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_411) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_412) c_create_data_~data~0.base) .cse2) v_ArrVal_413) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_412)) (.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_411) .cse3 v_ArrVal_413) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_414) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:26,014 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_412))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_411) .cse1 v_ArrVal_413) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_414) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_411) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_412) c_create_data_~data~0.base) .cse7) v_ArrVal_413)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv12 32)))))) is different from false [2021-12-14 19:39:26,091 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_412))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_411) .cse1 v_ArrVal_413) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_414) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_411) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_412) c_create_data_~data~0.base) .cse7) v_ArrVal_413)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd (_ bv16 32) .cse4 .cse5))))) is different from false [2021-12-14 19:39:26,329 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_409)) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_412))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_410) .cse0 v_ArrVal_411) .cse1 v_ArrVal_413) c_create_data_~data~0.base) .cse2) (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_414) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_409))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_410) .cse7 v_ArrVal_411) (select (select (store .cse8 .cse7 v_ArrVal_412) c_create_data_~data~0.base) .cse9) v_ArrVal_413))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd .cse5 (_ bv16 32) .cse6))))) is different from false [2021-12-14 19:39:28,460 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_409))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_412))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_410) .cse1 v_ArrVal_411) .cse2 v_ArrVal_413) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_414) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse7 (let ((.cse11 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_409))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_410) .cse9 v_ArrVal_411) (select (select (store .cse10 .cse9 v_ArrVal_412) c_create_data_~data~0.base) .cse11) v_ArrVal_413)))) c_create_data_~data~0.base) .cse11)))) (bvule (bvadd .cse6 .cse7 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false [2021-12-14 19:39:28,634 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_414 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_409))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_412))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_410) .cse1 v_ArrVal_411) .cse2 v_ArrVal_413) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_414) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_410 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_411 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_412 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_409 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_413 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_409))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_410) .cse8 v_ArrVal_411) (select (select (store .cse9 .cse8 v_ArrVal_412) c_create_data_~data~0.base) .cse10) v_ArrVal_413)))) c_create_data_~data~0.base) .cse10)))) (bvule (bvadd .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse6))))) is different from false [2021-12-14 19:39:28,676 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:28,677 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 177 treesize of output 178 [2021-12-14 19:39:28,705 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:28,705 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 167 treesize of output 108 [2021-12-14 19:39:28,720 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 9240 treesize of output 7818 [2021-12-14 19:39:28,835 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 34052 treesize of output 32894 [2021-12-14 19:39:28,998 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 32890 treesize of output 30650 [2021-12-14 19:39:29,087 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 30650 treesize of output 28410 [2021-12-14 19:39:29,173 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 28410 treesize of output 27898 [2021-12-14 19:39:29,260 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 27898 treesize of output 25146 [2021-12-14 19:39:29,352 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 25146 treesize of output 24186 [2021-12-14 19:39:29,436 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 24186 treesize of output 19914 [2021-12-14 19:39:30,860 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:30,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081986335] [2021-12-14 19:39:30,861 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-14 19:39:30,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [725960887] [2021-12-14 19:39:30,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:39:30,861 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:30,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:30,862 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-14 19:39:30,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-12-14 19:39:31,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 19:39:31,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:31,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-14 19:39:31,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:31,255 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:39:31,326 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 9 treesize of output 11 [2021-12-14 19:39:31,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:39:31,381 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 13 treesize of output 9 [2021-12-14 19:39:31,617 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:31,617 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 46 treesize of output 45 [2021-12-14 19:39:31,631 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 22 treesize of output 24 [2021-12-14 19:39:31,939 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:31,939 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 46 treesize of output 45 [2021-12-14 19:39:31,952 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 22 treesize of output 24 [2021-12-14 19:39:32,225 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:32,226 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 46 treesize of output 45 [2021-12-14 19:39:32,238 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 22 treesize of output 24 [2021-12-14 19:39:32,447 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 31 treesize of output 13 [2021-12-14 19:39:32,460 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 19 treesize of output 7 [2021-12-14 19:39:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:32,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:32,800 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_493) c_create_data_~data~0.base) .cse0) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_492) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_493) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse1 (_ bv4 32) .cse2) (bvadd .cse1 (_ bv8 32) .cse2))))) is different from false [2021-12-14 19:39:32,861 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_493) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_493) c_create_data_~data~0.base) .cse4) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_492) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:32,958 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_493) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_492) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_493) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse2 (_ bv8 32) .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-14 19:39:33,071 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_491)) (.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_490) .cse0 v_ArrVal_493) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_492) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_490) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_491) c_create_data_~data~0.base) .cse5) v_ArrVal_493) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse3 (_ bv8 32) .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-14 19:39:33,453 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_490) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_491) c_create_data_~data~0.base) .cse3) v_ArrVal_493)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_491))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_490) .cse5 v_ArrVal_493) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_492) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-14 19:39:33,570 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_491))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_490) .cse1 v_ArrVal_493) c_create_data_~data~0.base) .cse2) (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_492) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_490) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_491) c_create_data_~data~0.base) .cse7) v_ArrVal_493)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd .cse4 (_ bv16 32) .cse5))))) is different from false [2021-12-14 19:39:33,819 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_488))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_489) .cse2 v_ArrVal_490) (select (select (store .cse3 .cse2 v_ArrVal_491) c_create_data_~data~0.base) .cse4) v_ArrVal_493))) c_create_data_~data~0.base) .cse4))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_488)) (.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_491))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_489) .cse5 v_ArrVal_490) .cse6 v_ArrVal_493) c_create_data_~data~0.base) .cse7) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_492) c_create_data_~data~0.base) .cse7))))))))) is different from false [2021-12-14 19:39:36,081 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_488))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_489) .cse3 v_ArrVal_490) (select (select (store .cse4 .cse3 v_ArrVal_491) c_create_data_~data~0.base) .cse5) v_ArrVal_493)))) c_create_data_~data~0.base) .cse5)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_488))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_491))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_489) .cse7 v_ArrVal_490) .cse8 v_ArrVal_493) c_create_data_~data~0.base) .cse9)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_492) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2021-12-14 19:39:36,259 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_492 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_488))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_491))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_489) .cse1 v_ArrVal_490) .cse2 v_ArrVal_493) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_492) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_488 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_489 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_491 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_488))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_489) .cse8 v_ArrVal_490) (select (select (store .cse9 .cse8 v_ArrVal_491) c_create_data_~data~0.base) .cse10) v_ArrVal_493)))) c_create_data_~data~0.base) .cse10)))) (bvule (bvadd .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse6))))) is different from false [2021-12-14 19:39:36,335 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:36,335 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 177 treesize of output 168 [2021-12-14 19:39:36,388 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:36,388 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 157 treesize of output 108 [2021-12-14 19:39:36,409 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 1130 treesize of output 968 [2021-12-14 19:39:36,433 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 13084 treesize of output 12286 [2021-12-14 19:39:36,508 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 12282 treesize of output 11418 [2021-12-14 19:39:36,559 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 11418 treesize of output 11002 [2021-12-14 19:39:36,614 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 11002 treesize of output 10018 [2021-12-14 19:39:36,657 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 10018 treesize of output 8210 [2021-12-14 19:39:36,699 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 8210 treesize of output 7698 [2021-12-14 19:39:38,666 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-14 19:39:38,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010424826] [2021-12-14 19:39:38,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:39:38,667 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:38,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:38,668 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-14 19:39:38,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-14 19:39:39,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 19:39:39,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:39,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-14 19:39:39,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:39,224 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:39,224 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-14 19:39:39,285 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:39:39,382 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 13 treesize of output 9 [2021-12-14 19:39:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:39:39,813 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:39,813 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 46 treesize of output 45 [2021-12-14 19:39:39,833 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 22 treesize of output 24 [2021-12-14 19:39:40,337 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:40,338 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 46 treesize of output 45 [2021-12-14 19:39:40,358 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 22 treesize of output 24 [2021-12-14 19:39:40,841 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:40,841 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 46 treesize of output 45 [2021-12-14 19:39:40,862 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 22 treesize of output 24 [2021-12-14 19:39:41,197 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 31 treesize of output 13 [2021-12-14 19:39:41,215 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 19 treesize of output 7 [2021-12-14 19:39:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:41,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:41,662 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_572) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_572) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_571) c_create_data_~data~0.base) .cse2)))))) is different from false [2021-12-14 19:39:41,756 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_572) c_create_data_~data~0.base) .cse1) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_571) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_572) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse2 (_ bv4 32) .cse3) (bvadd .cse2 (_ bv8 32) .cse3))))) is different from false [2021-12-14 19:39:41,912 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_572) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_571) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_572) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse2 (_ bv8 32) .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-14 19:39:42,063 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_570)) (.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_569) .cse0 v_ArrVal_572) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_571) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_569) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_570) c_create_data_~data~0.base) .cse5) v_ArrVal_572) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-14 19:39:42,164 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_569) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_570) c_create_data_~data~0.base) .cse3) v_ArrVal_572)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_570))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_569) .cse5 v_ArrVal_572) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_571) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-14 19:39:42,327 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_570))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_569) .cse1 v_ArrVal_572) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_571) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_569) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_570) c_create_data_~data~0.base) .cse7) v_ArrVal_572)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd (_ bv16 32) .cse4 .cse5))))) is different from false [2021-12-14 19:39:42,492 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_568)) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_570))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_567) .cse0 v_ArrVal_569) .cse1 v_ArrVal_572) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_571) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_568))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_567) .cse7 v_ArrVal_569) (select (select (store .cse8 .cse7 v_ArrVal_570) c_create_data_~data~0.base) .cse9) v_ArrVal_572))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse6))))) is different from false [2021-12-14 19:39:42,617 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_568))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_567) .cse3 v_ArrVal_569) (select (select (store .cse4 .cse3 v_ArrVal_570) c_create_data_~data~0.base) .cse5) v_ArrVal_572)))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_568))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_570))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_567) .cse7 v_ArrVal_569) .cse8 v_ArrVal_572) c_create_data_~data~0.base) .cse9) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_571) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2021-12-14 19:39:42,786 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_568))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_570))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_567) .cse1 v_ArrVal_569) .cse2 v_ArrVal_572) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_571) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_569 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_568))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_567) .cse8 v_ArrVal_569) (select (select (store .cse9 .cse8 v_ArrVal_570) c_create_data_~data~0.base) .cse10) v_ArrVal_572)))) c_create_data_~data~0.base) .cse10)))) (bvule (bvadd .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse6))))) is different from false [2021-12-14 19:39:42,864 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:42,865 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 177 treesize of output 168 [2021-12-14 19:39:42,905 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:42,906 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 157 treesize of output 108 [2021-12-14 19:39:42,926 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 588 treesize of output 498 [2021-12-14 19:39:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1766 treesize of output 1628 [2021-12-14 19:39:42,991 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 1624 treesize of output 1512 [2021-12-14 19:39:43,015 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 1512 treesize of output 1472 [2021-12-14 19:39:43,040 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 1472 treesize of output 1240 [2021-12-14 19:39:43,063 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 1240 treesize of output 1096 [2021-12-14 19:39:43,088 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 1096 treesize of output 992 [2021-12-14 19:39:43,908 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:43,908 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 177 treesize of output 178 [2021-12-14 19:39:43,951 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:43,953 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 167 treesize of output 108 [2021-12-14 19:39:43,964 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:43,976 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 460 treesize of output 310 [2021-12-14 19:39:43,988 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:44,000 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 368 treesize of output 314 [2021-12-14 19:39:44,023 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 310 treesize of output 286 [2021-12-14 19:39:44,045 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 286 treesize of output 270 [2021-12-14 19:39:44,066 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 270 treesize of output 210 [2021-12-14 19:39:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2021-12-14 19:39:44,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010424826] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:44,546 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:44,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2021-12-14 19:39:44,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660620366] [2021-12-14 19:39:44,547 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:44,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-14 19:39:44,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:44,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-14 19:39:44,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=212, Unknown=27, NotChecked=1458, Total=1806 [2021-12-14 19:39:44,548 INFO L87 Difference]: Start difference. First operand 221 states and 245 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:56,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:56,511 INFO L93 Difference]: Finished difference Result 233 states and 257 transitions. [2021-12-14 19:39:56,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-14 19:39:56,513 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-14 19:39:56,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:56,514 INFO L225 Difference]: With dead ends: 233 [2021-12-14 19:39:56,514 INFO L226 Difference]: Without dead ends: 233 [2021-12-14 19:39:56,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 122 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=146, Invalid=355, Unknown=27, NotChecked=1728, Total=2256 [2021-12-14 19:39:56,515 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 26 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1658 SdHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 816 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:56,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 1658 Invalid, 1623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 789 Invalid, 0 Unknown, 816 Unchecked, 9.4s Time] [2021-12-14 19:39:56,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-14 19:39:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2021-12-14 19:39:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 172 states have (on average 1.4593023255813953) internal successors, (251), 226 states have internal predecessors, (251), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-14 19:39:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 255 transitions. [2021-12-14 19:39:56,518 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 255 transitions. Word has length 32 [2021-12-14 19:39:56,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:56,518 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 255 transitions. [2021-12-14 19:39:56,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-14 19:39:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 255 transitions. [2021-12-14 19:39:56,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-14 19:39:56,519 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:56,519 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:56,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:56,728 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:39:56,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-14 19:39:57,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-14 19:39:57,120 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:57,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1676760053, now seen corresponding path program 4 times [2021-12-14 19:39:57,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:57,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813715757] [2021-12-14 19:39:57,121 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-14 19:39:57,121 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:57,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:57,121 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:39:57,122 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:39:57,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-14 19:39:57,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:57,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-14 19:39:57,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:57,346 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:39:57,434 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 9 treesize of output 11 [2021-12-14 19:39:57,555 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 13 treesize of output 9 [2021-12-14 19:39:57,595 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 13 treesize of output 9 [2021-12-14 19:39:58,366 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:58,367 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 46 treesize of output 45 [2021-12-14 19:39:58,385 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 22 treesize of output 24 [2021-12-14 19:39:59,195 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:59,196 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 46 treesize of output 45 [2021-12-14 19:39:59,214 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 22 treesize of output 24 [2021-12-14 19:40:00,078 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:40:00,079 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 46 treesize of output 45 [2021-12-14 19:40:00,099 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 22 treesize of output 24 [2021-12-14 19:40:01,011 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:40:01,011 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 46 treesize of output 45 [2021-12-14 19:40:01,031 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 22 treesize of output 24 [2021-12-14 19:40:01,599 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 31 treesize of output 13 [2021-12-14 19:40:01,619 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 19 treesize of output 7 [2021-12-14 19:40:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:40:01,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:40:02,978 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_667) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_667) c_create_data_~data~0.base) .cse2) (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_668) c_create_data_~data~0.base) .cse2)))))) is different from false [2021-12-14 19:40:03,074 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_667) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_667) c_create_data_~data~0.base) .cse4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_668) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:40:03,246 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_667) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_668) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_667) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 (_ bv12 32) .cse3))))) is different from false [2021-12-14 19:40:03,413 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_666) c_create_data_~data~0.base) .cse2) v_ArrVal_667) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_666)) (.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_665) .cse3 v_ArrVal_667) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_668) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:40:03,767 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_666) c_create_data_~data~0.base) .cse3) v_ArrVal_667)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_666))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_665) .cse5 v_ArrVal_667) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_668) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-14 19:40:03,924 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_666))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_665) .cse1 v_ArrVal_667) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_668) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_665) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_666) c_create_data_~data~0.base) .cse7) v_ArrVal_667)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd (_ bv16 32) .cse4 .cse5))))) is different from false [2021-12-14 19:40:04,293 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_663))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_664) .cse2 v_ArrVal_665) (select (select (store .cse3 .cse2 v_ArrVal_666) c_create_data_~data~0.base) .cse4) v_ArrVal_667))) c_create_data_~data~0.base) .cse4))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 (_ bv16 32) .cse1)))) (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_663)) (.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_666))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_664) .cse5 v_ArrVal_665) .cse6 v_ArrVal_667) c_create_data_~data~0.base) .cse7) (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_668) c_create_data_~data~0.base) .cse7))))))))) is different from false [2021-12-14 19:40:06,465 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_663))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_666))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_664) .cse1 v_ArrVal_665) .cse2 v_ArrVal_667) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_668) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse7 (let ((.cse11 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_663))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_664) .cse9 v_ArrVal_665) (select (select (store .cse10 .cse9 v_ArrVal_666) c_create_data_~data~0.base) .cse11) v_ArrVal_667)))) c_create_data_~data~0.base) .cse11)))) (bvule (bvadd .cse6 (_ bv12 32) .cse7) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false [2021-12-14 19:40:06,678 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_663))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_666))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_664) .cse1 v_ArrVal_665) .cse2 v_ArrVal_667) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_668) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse7 (let ((.cse11 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_663))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_664) .cse9 v_ArrVal_665) (select (select (store .cse10 .cse9 v_ArrVal_666) c_create_data_~data~0.base) .cse11) v_ArrVal_667)))) c_create_data_~data~0.base) .cse11)))) (bvule (bvadd (_ bv16 32) .cse6 .cse7) (bvadd .cse6 (_ bv20 32) .cse7))))) is different from false [2021-12-14 19:40:08,763 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_662)) (.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_663))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_666))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_661) .cse0 v_ArrVal_664) .cse1 v_ArrVal_665) .cse2 v_ArrVal_667) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_668) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (let ((.cse12 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_662))) (let ((.cse9 (select (select .cse13 c_create_data_~data~0.base) .cse12))) (let ((.cse11 (store .cse13 .cse9 v_ArrVal_663))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse12))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_661) .cse9 v_ArrVal_664) .cse10 v_ArrVal_665) (select (select (store .cse11 .cse10 v_ArrVal_666) c_create_data_~data~0.base) .cse12) v_ArrVal_667))))) c_create_data_~data~0.base) .cse12))) (.cse8 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse7 .cse8) (bvadd .cse7 .cse8 (_ bv20 32)))))) is different from false [2021-12-14 19:40:12,053 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_662))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_663))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_661) .cse3 v_ArrVal_664) .cse4 v_ArrVal_665) (select (select (store .cse5 .cse4 v_ArrVal_666) c_create_data_~data~0.base) .cse6) v_ArrVal_667)))))) c_create_data_~data~0.base) .cse6))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv16 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv20 32))))) (forall ((v_ArrVal_662 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_663 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_664 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_665 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse12))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_662))) (let ((.cse9 (select (select .cse15 c_create_data_~data~0.base) .cse12))) (let ((.cse14 (store .cse15 .cse9 v_ArrVal_663))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse12))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_666))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse12))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_661) .cse9 v_ArrVal_664) .cse10 v_ArrVal_665) .cse11 v_ArrVal_667) c_create_data_~data~0.base) .cse12) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_668) c_create_data_~data~0.base) .cse12))))))))))))) is different from false