./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.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_test02-1.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 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:39:01,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:39:01,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:39:01,419 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:39:01,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:39:01,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:39:01,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:39:01,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:39:01,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:39:01,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:39:01,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:39:01,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:39:01,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:39:01,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:39:01,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:39:01,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:39:01,431 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:39:01,432 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:39:01,433 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:39:01,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:39:01,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:39:01,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:39:01,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:39:01,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:39:01,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:39:01,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:39:01,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:39:01,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:39:01,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:39:01,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:39:01,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:39:01,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:39:01,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:39:01,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:39:01,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:39:01,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:39:01,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:39:01,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:39:01,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:39:01,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:39:01,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:39:01,455 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:39:01,479 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:39:01,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:39:01,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:39:01,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:39:01,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:39:01,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:39:01,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:39:01,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:39:01,482 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:39:01,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:39:01,483 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:39:01,483 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:39:01,483 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:39:01,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:39:01,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:39:01,483 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:39:01,483 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:39:01,484 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:39:01,484 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:39:01,484 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:39:01,484 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:39:01,484 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:39:01,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:39:01,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:39:01,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:39:01,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:39:01,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:39:01,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:39:01,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-14 19:39:01,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-14 19:39:01,486 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:39:01,486 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 -> 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 [2021-12-14 19:39:01,682 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:39:01,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:39:01,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:39:01,701 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:39:01,701 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:39:01,702 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2021-12-14 19:39:01,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de439184/5e9160d75f874c3ab57e2084014bc3e2/FLAG7176c36de [2021-12-14 19:39:02,201 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:39:02,201 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2021-12-14 19:39:02,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de439184/5e9160d75f874c3ab57e2084014bc3e2/FLAG7176c36de [2021-12-14 19:39:02,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de439184/5e9160d75f874c3ab57e2084014bc3e2 [2021-12-14 19:39:02,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:39:02,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:39:02,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:02,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:39:02,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:39:02,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:02" (1/1) ... [2021-12-14 19:39:02,232 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c05121b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:02, skipping insertion in model container [2021-12-14 19:39:02,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:02" (1/1) ... [2021-12-14 19:39:02,237 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:39:02,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:39:02,498 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:02,507 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:39:02,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3223000c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:02, skipping insertion in model container [2021-12-14 19:39:02,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:02,509 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-14 19:39:02,510 INFO L158 Benchmark]: Toolchain (without parser) took 284.41ms. Allocated memory is still 88.1MB. Free memory was 56.3MB in the beginning and 62.5MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:39:02,511 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 44.6MB in the beginning and 44.6MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-14 19:39:02,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.64ms. Allocated memory is still 88.1MB. Free memory was 56.1MB in the beginning and 62.5MB in the end (delta: -6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-14 19:39:02,513 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.16ms. Allocated memory is still 88.1MB. Free memory was 44.6MB in the beginning and 44.6MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.64ms. Allocated memory is still 88.1MB. Free memory was 56.1MB in the beginning and 62.5MB in the end (delta: -6.3MB). 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_test02-1.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 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 --- Real Ultimate output --- This is Ultimate 0.2.2-839c364b5d67a0f615c82cb70ab247790648d4a9-839c364 [2021-12-14 19:39:03,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-14 19:39:03,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-14 19:39:03,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-14 19:39:03,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-14 19:39:03,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-14 19:39:03,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-14 19:39:03,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-14 19:39:04,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-14 19:39:04,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-14 19:39:04,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-14 19:39:04,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-14 19:39:04,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-14 19:39:04,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-14 19:39:04,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-14 19:39:04,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-14 19:39:04,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-14 19:39:04,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-14 19:39:04,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-14 19:39:04,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-14 19:39:04,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-14 19:39:04,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-14 19:39:04,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-14 19:39:04,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-14 19:39:04,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-14 19:39:04,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-14 19:39:04,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-14 19:39:04,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-14 19:39:04,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-14 19:39:04,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-14 19:39:04,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-14 19:39:04,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-14 19:39:04,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-14 19:39:04,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-14 19:39:04,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-14 19:39:04,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-14 19:39:04,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-14 19:39:04,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-14 19:39:04,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-14 19:39:04,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-14 19:39:04,037 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-14 19:39:04,037 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:04,065 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-14 19:39:04,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-14 19:39:04,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-14 19:39:04,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-14 19:39:04,067 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-14 19:39:04,067 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-14 19:39:04,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-14 19:39:04,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-14 19:39:04,069 INFO L138 SettingsManager]: * Use SBE=true [2021-12-14 19:39:04,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-14 19:39:04,070 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-14 19:39:04,070 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-14 19:39:04,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-14 19:39:04,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-14 19:39:04,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-14 19:39:04,070 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-14 19:39:04,071 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-14 19:39:04,071 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-14 19:39:04,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-14 19:39:04,071 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-14 19:39:04,071 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-14 19:39:04,071 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-14 19:39:04,071 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-14 19:39:04,072 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-14 19:39:04,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-14 19:39:04,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-14 19:39:04,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-14 19:39:04,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:39:04,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-14 19:39:04,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-14 19:39:04,073 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-14 19:39:04,073 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:04,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-14 19:39:04,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-14 19:39:04,074 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 -> 1489855b7530896bdd176b2b4b6c40b97d8289986908954c704880efe20dffb0 [2021-12-14 19:39:04,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-14 19:39:04,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-14 19:39:04,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-14 19:39:04,356 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-14 19:39:04,359 INFO L275 PluginConnector]: CDTParser initialized [2021-12-14 19:39:04,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2021-12-14 19:39:04,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c10bef82/46f088d4a337410c9e79725ed1c3638b/FLAG5046c65ff [2021-12-14 19:39:04,815 INFO L306 CDTParser]: Found 1 translation units. [2021-12-14 19:39:04,816 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-1.i [2021-12-14 19:39:04,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c10bef82/46f088d4a337410c9e79725ed1c3638b/FLAG5046c65ff [2021-12-14 19:39:05,218 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c10bef82/46f088d4a337410c9e79725ed1c3638b [2021-12-14 19:39:05,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-14 19:39:05,221 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-14 19:39:05,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:05,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-14 19:39:05,227 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-14 19:39:05,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:05" (1/1) ... [2021-12-14 19:39:05,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f6a9966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:05, skipping insertion in model container [2021-12-14 19:39:05,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:39:05" (1/1) ... [2021-12-14 19:39:05,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-14 19:39:05,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:39:05,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:05,547 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-14 19:39:05,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-14 19:39:05,591 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:05,604 INFO L203 MainTranslator]: Completed pre-run [2021-12-14 19:39:05,629 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-14 19:39:05,648 INFO L208 MainTranslator]: Completed translation [2021-12-14 19:39:05,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:05 WrapperNode [2021-12-14 19:39:05,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-14 19:39:05,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-14 19:39:05,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-14 19:39:05,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-14 19:39:05,653 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:05" (1/1) ... [2021-12-14 19:39:05,675 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:05" (1/1) ... [2021-12-14 19:39:05,693 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2021-12-14 19:39:05,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-14 19:39:05,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-14 19:39:05,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-14 19:39:05,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-14 19:39:05,701 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:05" (1/1) ... [2021-12-14 19:39:05,701 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:05" (1/1) ... [2021-12-14 19:39:05,718 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:05" (1/1) ... [2021-12-14 19:39:05,719 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:05" (1/1) ... [2021-12-14 19:39:05,748 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:05" (1/1) ... [2021-12-14 19:39:05,751 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:05" (1/1) ... [2021-12-14 19:39:05,753 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:05" (1/1) ... [2021-12-14 19:39:05,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-14 19:39:05,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-14 19:39:05,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-14 19:39:05,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-14 19:39:05,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:05" (1/1) ... [2021-12-14 19:39:05,777 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-14 19:39:05,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-14 19:39:05,793 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:05,810 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:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-14 19:39:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-14 19:39:05,827 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2021-12-14 19:39:05,828 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2021-12-14 19:39:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-14 19:39:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-14 19:39:05,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-14 19:39:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-14 19:39:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-14 19:39:05,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-14 19:39:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-14 19:39:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-14 19:39:05,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-14 19:39:05,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-14 19:39:05,966 INFO L236 CfgBuilder]: Building ICFG [2021-12-14 19:39:05,967 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-14 19:39:06,556 INFO L277 CfgBuilder]: Performing block encoding [2021-12-14 19:39:06,560 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-14 19:39:06,561 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-12-14 19:39:06,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:06 BoogieIcfgContainer [2021-12-14 19:39:06,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-14 19:39:06,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-14 19:39:06,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-14 19:39:06,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-14 19:39:06,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:39:05" (1/3) ... [2021-12-14 19:39:06,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b45cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:39:06, skipping insertion in model container [2021-12-14 19:39:06,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:39:05" (2/3) ... [2021-12-14 19:39:06,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b45cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:39:06, skipping insertion in model container [2021-12-14 19:39:06,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:39:06" (3/3) ... [2021-12-14 19:39:06,569 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-1.i [2021-12-14 19:39:06,573 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-14 19:39:06,573 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2021-12-14 19:39:06,603 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-14 19:39:06,607 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:06,607 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2021-12-14 19:39:06,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 190 states, 94 states have (on average 2.148936170212766) internal successors, (202), 186 states have internal predecessors, (202), 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,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:39:06,626 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:06,626 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:39:06,627 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:06,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:06,631 INFO L85 PathProgramCache]: Analyzing trace with hash 5083689, now seen corresponding path program 1 times [2021-12-14 19:39:06,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:06,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073530727] [2021-12-14 19:39:06,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:06,640 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:06,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:06,642 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:06,644 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:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:06,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-14 19:39:06,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:06,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:06,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:06,740 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:06,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073530727] [2021-12-14 19:39:06,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073530727] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:06,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:06,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:06,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888761689] [2021-12-14 19:39:06,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:06,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-14 19:39:06,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:06,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-14 19:39:06,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 19:39:06,769 INFO L87 Difference]: Start difference. First operand has 190 states, 94 states have (on average 2.148936170212766) internal successors, (202), 186 states have internal predecessors, (202), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:06,799 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2021-12-14 19:39:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-14 19:39:06,800 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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:06,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:06,808 INFO L225 Difference]: With dead ends: 190 [2021-12-14 19:39:06,808 INFO L226 Difference]: Without dead ends: 188 [2021-12-14 19:39:06,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-14 19:39:06,811 INFO L933 BasicCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:06,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-14 19:39:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-12-14 19:39:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 93 states have (on average 2.096774193548387) internal successors, (195), 184 states have internal predecessors, (195), 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,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2021-12-14 19:39:06,840 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 4 [2021-12-14 19:39:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:06,840 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2021-12-14 19:39:06,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2021-12-14 19:39:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:39:06,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:06,841 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:39:06,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-14 19:39:07,043 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:07,044 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:07,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:07,045 INFO L85 PathProgramCache]: Analyzing trace with hash 5081478, now seen corresponding path program 1 times [2021-12-14 19:39:07,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:07,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394911281] [2021-12-14 19:39:07,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:07,045 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:07,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:07,048 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:07,055 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:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:07,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:39:07,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:07,171 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:07,180 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:07,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:07,237 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:07,259 INFO L354 Elim1Store]: treesize reduction 4, result has 50.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, 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 15 treesize of output 15 [2021-12-14 19:39:07,277 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,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:07,278 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:07,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394911281] [2021-12-14 19:39:07,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394911281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:07,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:07,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:07,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007554730] [2021-12-14 19:39:07,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:07,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:07,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:07,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:07,283 INFO L87 Difference]: Start difference. First operand 188 states and 199 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:07,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:07,770 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2021-12-14 19:39:07,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:07,772 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:07,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:07,774 INFO L225 Difference]: With dead ends: 206 [2021-12-14 19:39:07,774 INFO L226 Difference]: Without dead ends: 206 [2021-12-14 19:39:07,774 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:07,775 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 32 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:07,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 355 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-14 19:39:07,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-14 19:39:07,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2021-12-14 19:39:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 98 states have (on average 2.0816326530612246) internal successors, (204), 189 states have internal predecessors, (204), 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:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 208 transitions. [2021-12-14 19:39:07,785 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 208 transitions. Word has length 4 [2021-12-14 19:39:07,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:07,785 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 208 transitions. [2021-12-14 19:39:07,785 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:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2021-12-14 19:39:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-14 19:39:07,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:07,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-14 19:39:07,798 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:07,991 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:07,992 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:07,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:07,992 INFO L85 PathProgramCache]: Analyzing trace with hash 5081477, now seen corresponding path program 1 times [2021-12-14 19:39:07,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:07,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791022130] [2021-12-14 19:39:07,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:07,996 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:07,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:07,997 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:07,998 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:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:08,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:08,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:08,053 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:08,075 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:08,075 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 18 treesize of output 23 [2021-12-14 19:39:08,093 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,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:08,093 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:08,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791022130] [2021-12-14 19:39:08,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791022130] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:08,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:08,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:08,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682839921] [2021-12-14 19:39:08,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:08,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:08,095 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:08,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:08,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:08,096 INFO L87 Difference]: Start difference. First operand 193 states and 208 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:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:08,283 INFO L93 Difference]: Finished difference Result 188 states and 202 transitions. [2021-12-14 19:39:08,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:08,285 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:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:08,286 INFO L225 Difference]: With dead ends: 188 [2021-12-14 19:39:08,286 INFO L226 Difference]: Without dead ends: 188 [2021-12-14 19:39:08,286 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:08,287 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 47 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:08,287 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 334 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2021-12-14 19:39:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2021-12-14 19:39:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2021-12-14 19:39:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 98 states have (on average 2.020408163265306) internal successors, (198), 184 states have internal predecessors, (198), 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:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 202 transitions. [2021-12-14 19:39:08,294 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 202 transitions. Word has length 4 [2021-12-14 19:39:08,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:08,295 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 202 transitions. [2021-12-14 19:39:08,295 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:08,295 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 202 transitions. [2021-12-14 19:39:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:39:08,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:08,295 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:39:08,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-14 19:39:08,501 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:08,501 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:08,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash 157525902, now seen corresponding path program 1 times [2021-12-14 19:39:08,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:08,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830324643] [2021-12-14 19:39:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:08,502 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:08,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:08,504 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:08,504 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:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:08,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:39:08,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:08,561 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:08,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:08,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:08,566 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:08,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830324643] [2021-12-14 19:39:08,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830324643] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:08,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:08,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:08,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036471684] [2021-12-14 19:39:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:08,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:08,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:08,568 INFO L87 Difference]: Start difference. First operand 188 states and 202 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:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:08,783 INFO L93 Difference]: Finished difference Result 211 states and 225 transitions. [2021-12-14 19:39:08,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:08,783 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:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:08,784 INFO L225 Difference]: With dead ends: 211 [2021-12-14 19:39:08,784 INFO L226 Difference]: Without dead ends: 211 [2021-12-14 19:39:08,784 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:08,785 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 65 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 234 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:08,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 234 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:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-14 19:39:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 186. [2021-12-14 19:39:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 98 states have (on average 1.989795918367347) internal successors, (195), 182 states have internal predecessors, (195), 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:08,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2021-12-14 19:39:08,791 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 5 [2021-12-14 19:39:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:08,791 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2021-12-14 19:39:08,791 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:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2021-12-14 19:39:08,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-14 19:39:08,792 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:08,792 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-14 19:39:08,807 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:08,997 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:08,998 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash 157525903, now seen corresponding path program 1 times [2021-12-14 19:39:08,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:08,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497973302] [2021-12-14 19:39:08,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:08,999 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:08,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:09,000 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:09,000 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:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:09,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:39:09,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:09,058 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:09,072 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,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:09,072 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:09,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497973302] [2021-12-14 19:39:09,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497973302] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:09,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:09,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:09,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741179464] [2021-12-14 19:39:09,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:09,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:09,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:09,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:09,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:09,073 INFO L87 Difference]: Start difference. First operand 186 states and 199 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:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:09,300 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2021-12-14 19:39:09,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:09,301 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:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:09,301 INFO L225 Difference]: With dead ends: 184 [2021-12-14 19:39:09,302 INFO L226 Difference]: Without dead ends: 184 [2021-12-14 19:39:09,302 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:09,302 INFO L933 BasicCegarLoop]: 182 mSDtfsCounter, 12 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 276 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:09,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 276 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:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2021-12-14 19:39:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2021-12-14 19:39:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 98 states have (on average 1.9591836734693877) internal successors, (192), 180 states have internal predecessors, (192), 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:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2021-12-14 19:39:09,308 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 5 [2021-12-14 19:39:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:09,308 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2021-12-14 19:39:09,308 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:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2021-12-14 19:39:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-14 19:39:09,309 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:09,309 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:09,317 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:09,509 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:09,509 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:09,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1058540239, now seen corresponding path program 1 times [2021-12-14 19:39:09,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:09,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977718863] [2021-12-14 19:39:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:09,510 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:09,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:09,511 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:09,512 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:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:09,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:09,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:09,569 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,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:09,569 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:09,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977718863] [2021-12-14 19:39:09,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977718863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:09,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:09,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:09,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492736870] [2021-12-14 19:39:09,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:09,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:09,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:09,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:09,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:09,571 INFO L87 Difference]: Start difference. First operand 184 states and 196 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:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:09,762 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2021-12-14 19:39:09,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:09,762 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:09,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:09,763 INFO L225 Difference]: With dead ends: 208 [2021-12-14 19:39:09,763 INFO L226 Difference]: Without dead ends: 208 [2021-12-14 19:39:09,763 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:09,764 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 54 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 240 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:09,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 240 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:09,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-14 19:39:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2021-12-14 19:39:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 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:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2021-12-14 19:39:09,769 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 7 [2021-12-14 19:39:09,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:09,769 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2021-12-14 19:39:09,769 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:09,769 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2021-12-14 19:39:09,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-14 19:39:09,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:09,769 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:09,781 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:09,977 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:09,977 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:09,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:09,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1322502935, now seen corresponding path program 1 times [2021-12-14 19:39:09,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:09,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906600999] [2021-12-14 19:39:09,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:09,978 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:09,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:09,979 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:09,979 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:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:10,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:39:10,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:10,042 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:10,084 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:10,084 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 16 treesize of output 16 [2021-12-14 19:39:10,133 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:10,139 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:10,180 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:10,183 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:10,198 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:10,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:10,198 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:10,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906600999] [2021-12-14 19:39:10,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906600999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:10,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:10,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:39:10,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912951415] [2021-12-14 19:39:10,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:10,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:10,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:10,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:10,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:10,200 INFO L87 Difference]: Start difference. First operand 183 states and 194 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:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:10,582 INFO L93 Difference]: Finished difference Result 185 states and 197 transitions. [2021-12-14 19:39:10,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:10,585 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:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:10,586 INFO L225 Difference]: With dead ends: 185 [2021-12-14 19:39:10,586 INFO L226 Difference]: Without dead ends: 185 [2021-12-14 19:39:10,586 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:10,587 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 4 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 753 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.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:10,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 753 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:39:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-14 19:39:10,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2021-12-14 19:39:10,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 99 states have (on average 1.9292929292929293) internal successors, (191), 180 states have internal predecessors, (191), 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:10,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2021-12-14 19:39:10,590 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 10 [2021-12-14 19:39:10,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:10,590 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2021-12-14 19:39:10,590 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:10,591 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2021-12-14 19:39:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-14 19:39:10,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:10,591 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:10,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:10,795 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:10,797 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:10,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash -388286564, now seen corresponding path program 1 times [2021-12-14 19:39:10,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:10,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217137801] [2021-12-14 19:39:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:10,798 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:10,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:10,799 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:10,799 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:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:10,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-14 19:39:10,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:10,889 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:10,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:10,890 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:10,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217137801] [2021-12-14 19:39:10,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217137801] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:10,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:10,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:39:10,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915003785] [2021-12-14 19:39:10,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:10,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:10,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:10,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:10,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:10,892 INFO L87 Difference]: Start difference. First operand 184 states and 195 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:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:10,917 INFO L93 Difference]: Finished difference Result 262 states and 277 transitions. [2021-12-14 19:39:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:39:10,918 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:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:10,919 INFO L225 Difference]: With dead ends: 262 [2021-12-14 19:39:10,919 INFO L226 Difference]: Without dead ends: 262 [2021-12-14 19:39:10,919 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:10,920 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 81 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 551 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:10,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 551 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:10,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-12-14 19:39:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 226. [2021-12-14 19:39:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 140 states have (on average 1.95) internal successors, (273), 221 states have internal predecessors, (273), 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,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 277 transitions. [2021-12-14 19:39:10,926 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 277 transitions. Word has length 12 [2021-12-14 19:39:10,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:10,927 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 277 transitions. [2021-12-14 19:39:10,927 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:10,927 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 277 transitions. [2021-12-14 19:39:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:39:10,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:10,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:10,939 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:11,137 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:11,137 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash 848024593, now seen corresponding path program 1 times [2021-12-14 19:39:11,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:11,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677420814] [2021-12-14 19:39:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:11,138 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:11,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:11,138 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:11,139 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:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:11,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:39:11,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:11,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:11,225 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:11,225 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:11,239 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:11,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:11,240 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:11,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677420814] [2021-12-14 19:39:11,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677420814] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:11,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:11,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:11,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021631247] [2021-12-14 19:39:11,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:11,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:11,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:11,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:11,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:11,241 INFO L87 Difference]: Start difference. First operand 226 states and 277 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:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:11,243 INFO L93 Difference]: Finished difference Result 225 states and 275 transitions. [2021-12-14 19:39:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:11,243 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:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:11,244 INFO L225 Difference]: With dead ends: 225 [2021-12-14 19:39:11,244 INFO L226 Difference]: Without dead ends: 225 [2021-12-14 19:39:11,244 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:11,246 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:11,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 100 Unchecked, 0.0s Time] [2021-12-14 19:39:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-12-14 19:39:11,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2021-12-14 19:39:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 140 states have (on average 1.9357142857142857) internal successors, (271), 220 states have internal predecessors, (271), 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,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 275 transitions. [2021-12-14 19:39:11,250 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 275 transitions. Word has length 13 [2021-12-14 19:39:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:11,250 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 275 transitions. [2021-12-14 19:39:11,250 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:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 275 transitions. [2021-12-14 19:39:11,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-14 19:39:11,251 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:11,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:11,259 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:11,457 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:11,457 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr5REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:11,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:11,458 INFO L85 PathProgramCache]: Analyzing trace with hash 848024594, now seen corresponding path program 1 times [2021-12-14 19:39:11,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:11,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495250751] [2021-12-14 19:39:11,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:11,458 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:11,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:11,459 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:11,463 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:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:11,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:11,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:11,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:11,547 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:11,551 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,565 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:11,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:11,566 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:11,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495250751] [2021-12-14 19:39:11,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495250751] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:11,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:11,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:11,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395101719] [2021-12-14 19:39:11,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:11,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:11,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:11,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:11,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:11,567 INFO L87 Difference]: Start difference. First operand 225 states and 275 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:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:11,833 INFO L93 Difference]: Finished difference Result 256 states and 311 transitions. [2021-12-14 19:39:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:11,834 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:11,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:11,835 INFO L225 Difference]: With dead ends: 256 [2021-12-14 19:39:11,835 INFO L226 Difference]: Without dead ends: 256 [2021-12-14 19:39:11,835 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:11,835 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 62 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:11,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 213 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:39:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2021-12-14 19:39:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 232. [2021-12-14 19:39:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 156 states have (on average 1.8397435897435896) internal successors, (287), 227 states have internal predecessors, (287), 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,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 291 transitions. [2021-12-14 19:39:11,839 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 291 transitions. Word has length 13 [2021-12-14 19:39:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:11,840 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 291 transitions. [2021-12-14 19:39:11,840 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:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 291 transitions. [2021-12-14 19:39:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:39:11,840 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:11,840 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:11,849 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:12,047 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:12,047 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:12,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash 503007254, now seen corresponding path program 1 times [2021-12-14 19:39:12,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:12,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256815601] [2021-12-14 19:39:12,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:12,048 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:12,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:12,049 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:12,049 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:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:12,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:12,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:12,124 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:12,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:12,124 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:12,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256815601] [2021-12-14 19:39:12,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256815601] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:12,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:12,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:39:12,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583836627] [2021-12-14 19:39:12,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:12,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:12,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:12,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:12,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:12,126 INFO L87 Difference]: Start difference. First operand 232 states and 291 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:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:12,156 INFO L93 Difference]: Finished difference Result 245 states and 307 transitions. [2021-12-14 19:39:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:12,157 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:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:12,158 INFO L225 Difference]: With dead ends: 245 [2021-12-14 19:39:12,158 INFO L226 Difference]: Without dead ends: 245 [2021-12-14 19:39:12,159 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:12,159 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 7 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 348 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:12,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 348 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:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-12-14 19:39:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 234. [2021-12-14 19:39:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 158 states have (on average 1.8291139240506329) internal successors, (289), 229 states have internal predecessors, (289), 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:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 293 transitions. [2021-12-14 19:39:12,163 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 293 transitions. Word has length 16 [2021-12-14 19:39:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:12,163 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 293 transitions. [2021-12-14 19:39:12,163 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:12,163 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 293 transitions. [2021-12-14 19:39:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-14 19:39:12,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:12,164 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:12,177 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:12,364 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:12,364 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:12,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash 503007304, now seen corresponding path program 1 times [2021-12-14 19:39:12,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:12,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321583430] [2021-12-14 19:39:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:12,365 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:12,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:12,366 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:12,366 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:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:12,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-14 19:39:12,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:12,440 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:12,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:12,440 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:12,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321583430] [2021-12-14 19:39:12,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321583430] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:12,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:12,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:12,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293545680] [2021-12-14 19:39:12,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:12,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:12,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:12,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:12,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:12,441 INFO L87 Difference]: Start difference. First operand 234 states and 293 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:12,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:12,617 INFO L93 Difference]: Finished difference Result 231 states and 269 transitions. [2021-12-14 19:39:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:12,618 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:12,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:12,619 INFO L225 Difference]: With dead ends: 231 [2021-12-14 19:39:12,619 INFO L226 Difference]: Without dead ends: 231 [2021-12-14 19:39:12,619 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:12,619 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 50 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:12,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 205 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-12-14 19:39:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 223. [2021-12-14 19:39:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 158 states have (on average 1.639240506329114) internal successors, (259), 218 states have internal predecessors, (259), 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:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 263 transitions. [2021-12-14 19:39:12,624 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 263 transitions. Word has length 16 [2021-12-14 19:39:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:12,624 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 263 transitions. [2021-12-14 19:39:12,624 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:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 263 transitions. [2021-12-14 19:39:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:39:12,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:12,624 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:12,643 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:12,831 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:12,831 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:12,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1586642756, now seen corresponding path program 1 times [2021-12-14 19:39:12,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:12,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740696859] [2021-12-14 19:39:12,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:12,832 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:12,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:12,833 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:12,833 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:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:12,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:39:12,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:12,921 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-14 19:39:12,921 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:12,937 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:12,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:12,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:12,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:12,962 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:12,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740696859] [2021-12-14 19:39:12,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740696859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:12,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:12,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:39:12,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219879458] [2021-12-14 19:39:12,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:12,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:39:12,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:12,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:39:12,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:39:12,963 INFO L87 Difference]: Start difference. First operand 223 states and 263 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:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:13,325 INFO L93 Difference]: Finished difference Result 228 states and 269 transitions. [2021-12-14 19:39:13,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:39:13,326 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:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:13,327 INFO L225 Difference]: With dead ends: 228 [2021-12-14 19:39:13,327 INFO L226 Difference]: Without dead ends: 228 [2021-12-14 19:39:13,327 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:13,327 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 4 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:13,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 432 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:39:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2021-12-14 19:39:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2021-12-14 19:39:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 162 states have (on average 1.6358024691358024) internal successors, (265), 222 states have internal predecessors, (265), 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:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 269 transitions. [2021-12-14 19:39:13,331 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 269 transitions. Word has length 17 [2021-12-14 19:39:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:13,331 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 269 transitions. [2021-12-14 19:39:13,331 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:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 269 transitions. [2021-12-14 19:39:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-14 19:39:13,331 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:13,331 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:13,338 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:13,538 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:13,538 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:13,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1586642755, now seen corresponding path program 1 times [2021-12-14 19:39:13,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:13,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333202058] [2021-12-14 19:39:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:13,539 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:13,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:13,540 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:13,545 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:13,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:13,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:39:13,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:13,633 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:13,633 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:13,653 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:13,658 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:13,710 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:13,713 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:13,725 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:13,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:13,726 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:13,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333202058] [2021-12-14 19:39:13,726 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333202058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:13,726 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:13,726 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:39:13,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385373971] [2021-12-14 19:39:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:13,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:13,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:13,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:13,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:13,727 INFO L87 Difference]: Start difference. First operand 227 states and 269 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:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:14,272 INFO L93 Difference]: Finished difference Result 229 states and 269 transitions. [2021-12-14 19:39:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:39:14,273 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:14,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:14,274 INFO L225 Difference]: With dead ends: 229 [2021-12-14 19:39:14,274 INFO L226 Difference]: Without dead ends: 229 [2021-12-14 19:39:14,274 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:14,274 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 4 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:14,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 513 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-14 19:39:14,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2021-12-14 19:39:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2021-12-14 19:39:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 162 states have (on average 1.623456790123457) internal successors, (263), 222 states have internal predecessors, (263), 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,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 267 transitions. [2021-12-14 19:39:14,278 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 267 transitions. Word has length 17 [2021-12-14 19:39:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:14,278 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 267 transitions. [2021-12-14 19:39:14,278 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:14,278 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 267 transitions. [2021-12-14 19:39:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:39:14,278 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:14,278 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:14,285 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:14,484 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:14,485 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:14,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:14,485 INFO L85 PathProgramCache]: Analyzing trace with hash 509612229, now seen corresponding path program 1 times [2021-12-14 19:39:14,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:14,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741425626] [2021-12-14 19:39:14,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:14,485 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:14,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:14,486 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:14,487 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:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:14,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-14 19:39:14,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:14,608 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-14 19:39:14,609 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: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,698 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:14,698 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:14,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 34 treesize of output 16 [2021-12-14 19:39:14,733 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:14,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:14,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_230) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32))))))) (_ bv1 1)))) is different from false [2021-12-14 19:39:14,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (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_230) c_create_data_~data~0.base) .cse0))))))))))) is different from false [2021-12-14 19:39:14,805 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:14,805 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 33 treesize of output 34 [2021-12-14 19:39:14,817 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 58 treesize of output 46 [2021-12-14 19:39:14,820 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 18 [2021-12-14 19:39:14,891 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:14,891 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:14,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741425626] [2021-12-14 19:39:14,892 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741425626] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:14,892 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:14,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2021-12-14 19:39:14,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788792827] [2021-12-14 19:39:14,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:14,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:39:14,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:14,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:39:14,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=40, Unknown=2, NotChecked=26, Total=90 [2021-12-14 19:39:14,892 INFO L87 Difference]: Start difference. First operand 227 states and 267 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:15,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:15,401 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2021-12-14 19:39:15,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:15,402 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:15,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:15,403 INFO L225 Difference]: With dead ends: 234 [2021-12-14 19:39:15,403 INFO L226 Difference]: Without dead ends: 234 [2021-12-14 19:39:15,403 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=50, Unknown=2, NotChecked=30, Total=110 [2021-12-14 19:39:15,403 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 49 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:15,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 690 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 324 Invalid, 0 Unknown, 287 Unchecked, 0.4s Time] [2021-12-14 19:39:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2021-12-14 19:39:15,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 226. [2021-12-14 19:39:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 162 states have (on average 1.6111111111111112) internal successors, (261), 221 states have internal predecessors, (261), 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:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 265 transitions. [2021-12-14 19:39:15,407 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 265 transitions. Word has length 22 [2021-12-14 19:39:15,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:15,407 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 265 transitions. [2021-12-14 19:39:15,408 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:15,408 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 265 transitions. [2021-12-14 19:39:15,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-14 19:39:15,408 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:15,408 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:15,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:15,615 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:15,615 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:15,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash 509612230, now seen corresponding path program 1 times [2021-12-14 19:39:15,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:15,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95032050] [2021-12-14 19:39:15,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:15,616 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:15,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:15,617 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:15,618 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:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:15,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-14 19:39:15,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:15,779 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:15,780 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:15,788 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:15,821 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:15,829 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:15,930 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:15,930 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:15,935 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:15,997 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:16,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 19 treesize of output 7 [2021-12-14 19:39:16,015 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:16,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:16,337 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_274) 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_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (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_274) 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_275) c_create_data_~data~0.base) .cse2)))))) is different from false [2021-12-14 19:39:16,365 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (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_274) 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_275) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_274 (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_274) 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:16,414 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_275 (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_274) c_create_data_~data~0.base) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_275) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_274 (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_274) c_create_data_~data~0.base) .cse3)))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))) is different from false [2021-12-14 19:39:16,431 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:16,431 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:16,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 54 treesize of output 36 [2021-12-14 19:39:16,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-14 19:39:16,451 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:16,451 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:16,458 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:16,458 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:16,460 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:16,463 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:16,465 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:16,466 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:16,529 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:16,530 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:16,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95032050] [2021-12-14 19:39:16,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95032050] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:16,530 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:16,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-14 19:39:16,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611693623] [2021-12-14 19:39:16,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:16,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-14 19:39:16,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:16,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-14 19:39:16,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2021-12-14 19:39:16,531 INFO L87 Difference]: Start difference. First operand 226 states and 265 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:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:18,715 INFO L93 Difference]: Finished difference Result 238 states and 277 transitions. [2021-12-14 19:39:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-14 19:39:18,717 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:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:18,717 INFO L225 Difference]: With dead ends: 238 [2021-12-14 19:39:18,717 INFO L226 Difference]: Without dead ends: 238 [2021-12-14 19:39:18,718 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:18,718 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 14 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:18,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 1015 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 594 Invalid, 0 Unknown, 272 Unchecked, 2.0s Time] [2021-12-14 19:39:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-12-14 19:39:18,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2021-12-14 19:39:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 172 states have (on average 1.5755813953488371) internal successors, (271), 231 states have internal predecessors, (271), 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:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 275 transitions. [2021-12-14 19:39:18,722 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 275 transitions. Word has length 22 [2021-12-14 19:39:18,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:18,722 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 275 transitions. [2021-12-14 19:39:18,722 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:18,722 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 275 transitions. [2021-12-14 19:39:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-14 19:39:18,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:18,723 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:18,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:18,923 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:18,923 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:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2075876957, now seen corresponding path program 2 times [2021-12-14 19:39:18,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:18,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061844156] [2021-12-14 19:39:18,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-14 19:39:18,924 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:18,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:18,925 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:18,939 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:19,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-14 19:39:19,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:19,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-14 19:39:19,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:19,114 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:19,126 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:19,146 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:19,154 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:19,257 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:19,257 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:19,262 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:19,379 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-14 19:39:19,380 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:19,383 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:19,448 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:19,452 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:19,469 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:19,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:19,802 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (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_337) 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_336) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_337) 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:19,841 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_337 (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_337) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (forall ((v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (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_337) 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_336) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:19,891 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_337 (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_337) 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_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (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_337) 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_336) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:19,952 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))) (v_ArrVal_337 (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_334) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_335) c_create_data_~data~0.base) .cse2) v_ArrVal_337) 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_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_335)) (.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_334) .cse3 v_ArrVal_337) 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_336) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-14 19:39:20,180 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))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (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_334) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_335) c_create_data_~data~0.base) .cse3) v_ArrVal_337)) c_create_data_~data~0.base) .cse3)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (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_335))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_334) .cse5 v_ArrVal_337) c_create_data_~data~0.base) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_336) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-14 19:39:20,226 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))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_334) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_335) c_create_data_~data~0.base) .cse2) v_ArrVal_337)) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_336 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_337 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_335))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_334) .cse4 v_ArrVal_337) c_create_data_~data~0.base) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_336) c_create_data_~data~0.base) .cse5))))))))) is different from false [2021-12-14 19:39:20,242 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,242 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,249 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,249 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,252 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,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 144 [2021-12-14 19:39:20,263 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 102 treesize of output 86 [2021-12-14 19:39:20,266 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 124 treesize of output 100 [2021-12-14 19:39:20,274 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 70 treesize of output 62 [2021-12-14 19:39:20,338 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,338 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:20,348 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-14 19:39:20,349 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 79 treesize of output 60 [2021-12-14 19:39:20,352 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:20,355 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 92 treesize of output 56 [2021-12-14 19:39:20,357 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:20,360 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 50 treesize of output 32 [2021-12-14 19:39:20,365 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-14 19:39:20,434 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:20,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:20,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061844156] [2021-12-14 19:39:20,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061844156] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:20,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:20,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2021-12-14 19:39:20,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701443858] [2021-12-14 19:39:20,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:20,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-14 19:39:20,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:20,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-14 19:39:20,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2021-12-14 19:39:20,436 INFO L87 Difference]: Start difference. First operand 236 states and 275 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:22,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:22,858 INFO L93 Difference]: Finished difference Result 248 states and 287 transitions. [2021-12-14 19:39:22,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-14 19:39:22,859 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:22,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:22,860 INFO L225 Difference]: With dead ends: 248 [2021-12-14 19:39:22,860 INFO L226 Difference]: Without dead ends: 248 [2021-12-14 19:39:22,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2021-12-14 19:39:22,861 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 21 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 550 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:22,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 1264 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 641 Invalid, 0 Unknown, 550 Unchecked, 2.0s Time] [2021-12-14 19:39:22,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2021-12-14 19:39:22,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2021-12-14 19:39:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 182 states have (on average 1.543956043956044) internal successors, (281), 241 states have internal predecessors, (281), 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:22,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 285 transitions. [2021-12-14 19:39:22,865 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 285 transitions. Word has length 27 [2021-12-14 19:39:22,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:22,866 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 285 transitions. [2021-12-14 19:39:22,866 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:22,866 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 285 transitions. [2021-12-14 19:39:22,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-14 19:39:22,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:22,870 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:22,881 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:23,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:23,079 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:23,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:23,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1508640986, now seen corresponding path program 3 times [2021-12-14 19:39:23,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:23,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465217888] [2021-12-14 19:39:23,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-14 19:39:23,079 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:23,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:23,112 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:39:23,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-14 19:39:23,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-14 19:39:23,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-14 19:39:23,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-14 19:39:23,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:23,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-14 19:39:23,512 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:23,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465217888] [2021-12-14 19:39:23,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465217888] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-14 19:39:23,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-14 19:39:23,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-14 19:39:23,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433994088] [2021-12-14 19:39:23,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-14 19:39:23,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-14 19:39:23,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:23,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-14 19:39:23,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:39:23,513 INFO L87 Difference]: Start difference. First operand 246 states and 285 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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:23,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:23,614 INFO L93 Difference]: Finished difference Result 243 states and 279 transitions. [2021-12-14 19:39:23,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:23,614 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:23,615 INFO L225 Difference]: With dead ends: 243 [2021-12-14 19:39:23,615 INFO L226 Difference]: Without dead ends: 243 [2021-12-14 19:39:23,615 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:39:23,616 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 144 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:23,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 788 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:39:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-14 19:39:23,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2021-12-14 19:39:23,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 178 states have (on average 1.5337078651685394) internal successors, (273), 236 states have internal predecessors, (273), 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:23,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 277 transitions. [2021-12-14 19:39:23,620 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 277 transitions. Word has length 32 [2021-12-14 19:39:23,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:23,620 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 277 transitions. [2021-12-14 19:39:23,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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:23,621 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 277 transitions. [2021-12-14 19:39:23,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:39:23,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:23,622 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:23,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:23,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:23,831 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting create_dataErr24REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1091018630, now seen corresponding path program 1 times [2021-12-14 19:39:23,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:23,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859469552] [2021-12-14 19:39:23,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:23,831 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:23,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:23,832 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:39:23,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-14 19:39:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:23,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:39:23,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:24,003 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:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:24,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:24,007 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:24,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859469552] [2021-12-14 19:39:24,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1859469552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:24,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:24,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:24,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221966741] [2021-12-14 19:39:24,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:24,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:24,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:24,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:24,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:24,008 INFO L87 Difference]: Start difference. First operand 241 states and 277 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:24,157 INFO L93 Difference]: Finished difference Result 243 states and 271 transitions. [2021-12-14 19:39:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:24,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 42 [2021-12-14 19:39:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:24,158 INFO L225 Difference]: With dead ends: 243 [2021-12-14 19:39:24,158 INFO L226 Difference]: Without dead ends: 243 [2021-12-14 19:39:24,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:24,159 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 22 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:24,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 235 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-14 19:39:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-12-14 19:39:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2021-12-14 19:39:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 178 states have (on average 1.4662921348314606) internal successors, (261), 232 states have internal predecessors, (261), 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,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2021-12-14 19:39:24,163 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 42 [2021-12-14 19:39:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:24,163 INFO L470 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2021-12-14 19:39:24,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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,163 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2021-12-14 19:39:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-12-14 19:39:24,164 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:24,164 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:24,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:24,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:24,371 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting create_dataErr25REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:24,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1091018631, now seen corresponding path program 1 times [2021-12-14 19:39:24,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:24,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890357897] [2021-12-14 19:39:24,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:24,372 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:24,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:24,373 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:24,374 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:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:24,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:39:24,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:24,543 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:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:24,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:24,556 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:24,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890357897] [2021-12-14 19:39:24,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890357897] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:24,556 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:24,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-14 19:39:24,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334345364] [2021-12-14 19:39:24,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:24,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-14 19:39:24,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:24,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-14 19:39:24,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-14 19:39:24,560 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:24,780 INFO L93 Difference]: Finished difference Result 239 states and 259 transitions. [2021-12-14 19:39:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-14 19:39:24,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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 42 [2021-12-14 19:39:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:24,782 INFO L225 Difference]: With dead ends: 239 [2021-12-14 19:39:24,782 INFO L226 Difference]: Without dead ends: 239 [2021-12-14 19:39:24,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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:24,783 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 18 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:24,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 234 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-12-14 19:39:24,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2021-12-14 19:39:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 178 states have (on average 1.398876404494382) internal successors, (249), 228 states have internal predecessors, (249), 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,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 253 transitions. [2021-12-14 19:39:24,791 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 253 transitions. Word has length 42 [2021-12-14 19:39:24,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:24,791 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 253 transitions. [2021-12-14 19:39:24,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 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,792 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 253 transitions. [2021-12-14 19:39:24,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 19:39:24,793 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:24,794 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:24,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:25,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:25,002 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:25,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1777365236, now seen corresponding path program 1 times [2021-12-14 19:39:25,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:25,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141601340] [2021-12-14 19:39:25,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:25,004 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:25,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:25,005 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:39:25,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-14 19:39:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:25,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:39:25,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:25,266 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:25,331 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:25,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 15 treesize of output 9 [2021-12-14 19:39:26,273 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:26,296 INFO L354 Elim1Store]: treesize reduction 42, result has 33.3 percent of original size [2021-12-14 19:39:26,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 41 [2021-12-14 19:39:26,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:26,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:30,434 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:30,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141601340] [2021-12-14 19:39:30,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141601340] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:30,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [407299697] [2021-12-14 19:39:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:30,434 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:30,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:30,435 INFO L229 MonitoredProcess]: Starting monitored process 23 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,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2021-12-14 19:39:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:30,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:39:30,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:30,754 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:33,224 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:33,241 INFO L354 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-14 19:39:33,241 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 2 case distinctions, treesize of input 18 treesize of output 32 [2021-12-14 19:39:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:33,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:33,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [407299697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:33,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:33,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2021-12-14 19:39:33,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075921853] [2021-12-14 19:39:33,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:33,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:39:33,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:33,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:39:33,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=96, Unknown=3, NotChecked=0, Total=132 [2021-12-14 19:39:33,257 INFO L87 Difference]: Start difference. First operand 233 states and 253 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:33,495 INFO L93 Difference]: Finished difference Result 294 states and 323 transitions. [2021-12-14 19:39:33,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-14 19:39:33,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-12-14 19:39:33,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:33,497 INFO L225 Difference]: With dead ends: 294 [2021-12-14 19:39:33,497 INFO L226 Difference]: Without dead ends: 294 [2021-12-14 19:39:33,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=33, Invalid=96, Unknown=3, NotChecked=0, Total=132 [2021-12-14 19:39:33,497 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 76 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:33,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 483 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 266 Unchecked, 0.2s Time] [2021-12-14 19:39:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-12-14 19:39:33,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 249. [2021-12-14 19:39:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 192 states have (on average 1.4010416666666667) internal successors, (269), 242 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:39:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 275 transitions. [2021-12-14 19:39:33,501 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 275 transitions. Word has length 45 [2021-12-14 19:39:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:33,501 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 275 transitions. [2021-12-14 19:39:33,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 7 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 275 transitions. [2021-12-14 19:39:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-12-14 19:39:33,501 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:33,501 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:33,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:33,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2021-12-14 19:39:33,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:33,911 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:33,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:33,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1777365235, now seen corresponding path program 1 times [2021-12-14 19:39:33,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:33,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939954585] [2021-12-14 19:39:33,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:33,912 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:33,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:33,913 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:39:33,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-14 19:39:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:34,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:39:34,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:34,155 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:34,159 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:34,248 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:34,287 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 9 [2021-12-14 19:39:34,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:34,572 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:39:34,572 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 2 case distinctions, treesize of input 15 treesize of output 27 [2021-12-14 19:39:34,583 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:34,583 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 19 treesize of output 19 [2021-12-14 19:39:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:34,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:38,020 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:38,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939954585] [2021-12-14 19:39:38,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939954585] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:38,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1451035067] [2021-12-14 19:39:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:38,021 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:38,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:38,022 INFO L229 MonitoredProcess]: Starting monitored process 25 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:38,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2021-12-14 19:39:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:38,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-14 19:39:38,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:38,552 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:38,556 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:38,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:38,956 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:39:38,957 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 2 case distinctions, treesize of input 15 treesize of output 27 [2021-12-14 19:39:38,967 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:38,967 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:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:38,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:38,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1451035067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:38,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:38,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 8 [2021-12-14 19:39:38,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683426463] [2021-12-14 19:39:38,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:38,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-14 19:39:39,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:39,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-14 19:39:39,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-12-14 19:39:39,000 INFO L87 Difference]: Start difference. First operand 249 states and 275 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:39,451 INFO L93 Difference]: Finished difference Result 318 states and 351 transitions. [2021-12-14 19:39:39,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:39:39,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2021-12-14 19:39:39,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:39,455 INFO L225 Difference]: With dead ends: 318 [2021-12-14 19:39:39,455 INFO L226 Difference]: Without dead ends: 318 [2021-12-14 19:39:39,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-14 19:39:39,456 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 78 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:39,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 585 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 182 Unchecked, 0.4s Time] [2021-12-14 19:39:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-12-14 19:39:39,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 249. [2021-12-14 19:39:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 192 states have (on average 1.390625) internal successors, (267), 242 states have internal predecessors, (267), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:39:39,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 273 transitions. [2021-12-14 19:39:39,460 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 273 transitions. Word has length 45 [2021-12-14 19:39:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:39,460 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 273 transitions. [2021-12-14 19:39:39,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 273 transitions. [2021-12-14 19:39:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 19:39:39,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:39,461 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:39,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:39,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:39,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:39,865 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:39,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:39,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1240596815, now seen corresponding path program 1 times [2021-12-14 19:39:39,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:39,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742738828] [2021-12-14 19:39:39,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:39,866 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:39,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:39,867 INFO L229 MonitoredProcess]: Starting monitored process 26 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:39,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-14 19:39:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:40,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:39:40,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:40,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:40,159 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:40,160 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:40,197 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-14 19:39:40,197 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 3 case distinctions, treesize of input 30 treesize of output 36 [2021-12-14 19:39:40,261 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-14 19:39:40,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 23 [2021-12-14 19:39:40,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:40,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:40,307 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:40,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742738828] [2021-12-14 19:39:40,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742738828] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:40,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:40,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-14 19:39:40,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687828640] [2021-12-14 19:39:40,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:40,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:40,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:40,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:40,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:39:40,309 INFO L87 Difference]: Start difference. First operand 249 states and 273 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:40,623 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2021-12-14 19:39:40,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:39:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-12-14 19:39:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:40,625 INFO L225 Difference]: With dead ends: 293 [2021-12-14 19:39:40,625 INFO L226 Difference]: Without dead ends: 293 [2021-12-14 19:39:40,625 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-12-14 19:39:40,626 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 27 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:40,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 711 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:39:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2021-12-14 19:39:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 259. [2021-12-14 19:39:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 202 states have (on average 1.3762376237623761) internal successors, (278), 252 states have internal predecessors, (278), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:39:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 284 transitions. [2021-12-14 19:39:40,629 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 284 transitions. Word has length 47 [2021-12-14 19:39:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:40,629 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 284 transitions. [2021-12-14 19:39:40,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 284 transitions. [2021-12-14 19:39:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 19:39:40,630 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:40,630 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:40,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:40,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:40,839 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:40,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1147840785, now seen corresponding path program 1 times [2021-12-14 19:39:40,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:40,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148374694] [2021-12-14 19:39:40,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:40,840 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:40,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:40,841 INFO L229 MonitoredProcess]: Starting monitored process 27 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:40,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-14 19:39:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:40,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-14 19:39:40,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:41,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:41,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:41,051 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:41,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148374694] [2021-12-14 19:39:41,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148374694] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:41,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:39:41,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:39:41,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989056537] [2021-12-14 19:39:41,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:41,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:41,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:41,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:41,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:39:41,054 INFO L87 Difference]: Start difference. First operand 259 states and 284 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:41,072 INFO L93 Difference]: Finished difference Result 267 states and 290 transitions. [2021-12-14 19:39:41,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:39:41,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-12-14 19:39:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:41,075 INFO L225 Difference]: With dead ends: 267 [2021-12-14 19:39:41,075 INFO L226 Difference]: Without dead ends: 267 [2021-12-14 19:39:41,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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:41,076 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 3 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:41,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 458 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-14 19:39:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2021-12-14 19:39:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2021-12-14 19:39:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 208 states have (on average 1.3557692307692308) internal successors, (282), 258 states have internal predecessors, (282), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-14 19:39:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 288 transitions. [2021-12-14 19:39:41,079 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 288 transitions. Word has length 47 [2021-12-14 19:39:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:41,080 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 288 transitions. [2021-12-14 19:39:41,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 288 transitions. [2021-12-14 19:39:41,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 19:39:41,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:41,080 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:41,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:41,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:41,288 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:41,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1348996156, now seen corresponding path program 1 times [2021-12-14 19:39:41,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:41,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308834691] [2021-12-14 19:39:41,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:41,289 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:41,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:41,290 INFO L229 MonitoredProcess]: Starting monitored process 28 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:41,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-14 19:39:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:41,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:39:41,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:41,620 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:41,663 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 9 [2021-12-14 19:39:41,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:41,969 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:39:41,969 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 2 case distinctions, treesize of input 17 treesize of output 29 [2021-12-14 19:39:41,979 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:41,979 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:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:42,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:42,473 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:42,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308834691] [2021-12-14 19:39:42,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308834691] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:42,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1601132227] [2021-12-14 19:39:42,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:42,474 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:42,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:42,475 INFO L229 MonitoredProcess]: Starting monitored process 29 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:42,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2021-12-14 19:39:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:42,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:39:42,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:42,827 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:42,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:42,862 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:43,005 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:39:44,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:44,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:44,375 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:39:44,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2021-12-14 19:39:44,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:44,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:44,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1601132227] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:44,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:44,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2021-12-14 19:39:44,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044653795] [2021-12-14 19:39:44,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:44,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:39:44,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:39:44,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:39:44,504 INFO L87 Difference]: Start difference. First operand 265 states and 288 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:45,132 INFO L93 Difference]: Finished difference Result 305 states and 332 transitions. [2021-12-14 19:39:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:39:45,132 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-12-14 19:39:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:45,133 INFO L225 Difference]: With dead ends: 305 [2021-12-14 19:39:45,133 INFO L226 Difference]: Without dead ends: 305 [2021-12-14 19:39:45,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-12-14 19:39:45,134 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 14 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:45,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 554 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 144 Unchecked, 0.5s Time] [2021-12-14 19:39:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-12-14 19:39:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2021-12-14 19:39:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 245 states have (on average 1.3142857142857143) internal successors, (322), 295 states have internal predecessors, (322), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 19:39:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 331 transitions. [2021-12-14 19:39:45,138 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 331 transitions. Word has length 47 [2021-12-14 19:39:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:45,138 INFO L470 AbstractCegarLoop]: Abstraction has 304 states and 331 transitions. [2021-12-14 19:39:45,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 331 transitions. [2021-12-14 19:39:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-12-14 19:39:45,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:45,139 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:45,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:45,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:45,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:45,543 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:45,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1348996155, now seen corresponding path program 1 times [2021-12-14 19:39:45,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:45,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770198784] [2021-12-14 19:39:45,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:45,544 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:45,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:45,545 INFO L229 MonitoredProcess]: Starting monitored process 30 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:45,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-14 19:39:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:45,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-14 19:39:45,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:45,818 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:45,864 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 9 [2021-12-14 19:39:46,448 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-14 19:39:46,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 41 [2021-12-14 19:39:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:46,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:47,232 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:47,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770198784] [2021-12-14 19:39:47,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770198784] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:47,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:47,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-12-14 19:39:47,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442832498] [2021-12-14 19:39:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:47,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:39:47,233 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:47,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:39:47,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:47,233 INFO L87 Difference]: Start difference. First operand 304 states and 331 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:47,384 INFO L93 Difference]: Finished difference Result 332 states and 359 transitions. [2021-12-14 19:39:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-14 19:39:47,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2021-12-14 19:39:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:47,385 INFO L225 Difference]: With dead ends: 332 [2021-12-14 19:39:47,385 INFO L226 Difference]: Without dead ends: 332 [2021-12-14 19:39:47,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:39:47,386 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 57 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:47,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 267 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 75 Unchecked, 0.1s Time] [2021-12-14 19:39:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-12-14 19:39:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 306. [2021-12-14 19:39:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 247 states have (on average 1.311740890688259) internal successors, (324), 297 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2021-12-14 19:39:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 333 transitions. [2021-12-14 19:39:47,390 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 333 transitions. Word has length 47 [2021-12-14 19:39:47,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:47,390 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 333 transitions. [2021-12-14 19:39:47,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 333 transitions. [2021-12-14 19:39:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 19:39:47,390 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:47,390 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:47,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2021-12-14 19:39:47,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:39:47,598 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 10765426, now seen corresponding path program 1 times [2021-12-14 19:39:47,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:47,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225135033] [2021-12-14 19:39:47,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:47,599 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:47,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:47,600 INFO L229 MonitoredProcess]: Starting monitored process 31 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:47,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-14 19:39:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:47,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-14 19:39:47,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:47,910 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:47,985 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:48,060 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 9 [2021-12-14 19:39:49,039 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:49,060 INFO L354 Elim1Store]: treesize reduction 42, result has 33.3 percent of original size [2021-12-14 19:39:49,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 42 [2021-12-14 19:39:49,095 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:49,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:53,171 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:53,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225135033] [2021-12-14 19:39:53,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225135033] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:53,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [229739980] [2021-12-14 19:39:53,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:53,172 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:53,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:53,173 INFO L229 MonitoredProcess]: Starting monitored process 32 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:53,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2021-12-14 19:39:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:53,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-14 19:39:53,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:53,537 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:55,936 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:39:55,954 INFO L354 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2021-12-14 19:39:55,954 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 2 case distinctions, treesize of input 21 treesize of output 35 [2021-12-14 19:39:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:39:55,969 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:39:55,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [229739980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:39:55,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:39:55,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2021-12-14 19:39:55,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751612241] [2021-12-14 19:39:55,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:39:55,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:39:55,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:39:55,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:39:55,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=78, Unknown=3, NotChecked=0, Total=110 [2021-12-14 19:39:55,970 INFO L87 Difference]: Start difference. First operand 306 states and 333 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:39:56,169 INFO L93 Difference]: Finished difference Result 358 states and 391 transitions. [2021-12-14 19:39:56,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:39:56,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-12-14 19:39:56,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:39:56,171 INFO L225 Difference]: With dead ends: 358 [2021-12-14 19:39:56,171 INFO L226 Difference]: Without dead ends: 358 [2021-12-14 19:39:56,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=29, Invalid=78, Unknown=3, NotChecked=0, Total=110 [2021-12-14 19:39:56,171 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 75 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:39:56,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 402 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 148 Unchecked, 0.2s Time] [2021-12-14 19:39:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-12-14 19:39:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 317. [2021-12-14 19:39:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 257 states have (on average 1.311284046692607) internal successors, (337), 307 states have internal predecessors, (337), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 19:39:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 348 transitions. [2021-12-14 19:39:56,176 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 348 transitions. Word has length 49 [2021-12-14 19:39:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:39:56,176 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 348 transitions. [2021-12-14 19:39:56,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:39:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 348 transitions. [2021-12-14 19:39:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 19:39:56,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:39:56,177 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:39:56,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-14 19:39:56,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2021-12-14 19:39:56,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:56,586 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:39:56,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:39:56,586 INFO L85 PathProgramCache]: Analyzing trace with hash 10765427, now seen corresponding path program 1 times [2021-12-14 19:39:56,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:39:56,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589046387] [2021-12-14 19:39:56,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:56,587 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:39:56,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:39:56,588 INFO L229 MonitoredProcess]: Starting monitored process 33 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:56,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-14 19:39:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:39:56,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:39:56,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:39:56,879 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:56,883 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:56,969 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,010 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 9 [2021-12-14 19:39:57,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:39:57,329 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:39:57,329 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 2 case distinctions, treesize of input 15 treesize of output 27 [2021-12-14 19:39:57,339 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:39:57,339 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:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:39:57,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:39:59,566 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:39:59,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589046387] [2021-12-14 19:39:59,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589046387] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:39:59,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1616356361] [2021-12-14 19:39:59,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:39:59,567 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:39:59,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:39:59,568 INFO L229 MonitoredProcess]: Starting monitored process 34 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:59,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2021-12-14 19:40:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:00,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:40:00,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:00,038 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:40:00,042 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:40:02,099 WARN L860 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2050 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_2050) |c_create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)) (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_old(#valid)| create_data_~data~0.base))))))) is different from true [2021-12-14 19:40:02,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:02,489 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:40:02,489 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 2 case distinctions, treesize of input 15 treesize of output 27 [2021-12-14 19:40:02,499 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:40:02,499 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:40:02,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:40:02,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:40:02,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1616356361] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:02,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:40:02,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2021-12-14 19:40:02,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252428093] [2021-12-14 19:40:02,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:02,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:40:02,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:40:02,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:40:02,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=86, Unknown=2, NotChecked=18, Total=132 [2021-12-14 19:40:02,530 INFO L87 Difference]: Start difference. First operand 317 states and 348 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:02,984 INFO L93 Difference]: Finished difference Result 382 states and 417 transitions. [2021-12-14 19:40:02,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-14 19:40:02,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-12-14 19:40:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:02,986 INFO L225 Difference]: With dead ends: 382 [2021-12-14 19:40:02,986 INFO L226 Difference]: Without dead ends: 382 [2021-12-14 19:40:02,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=32, Invalid=102, Unknown=2, NotChecked=20, Total=156 [2021-12-14 19:40:02,986 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 78 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 435 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:02,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 584 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 318 Invalid, 0 Unknown, 435 Unchecked, 0.4s Time] [2021-12-14 19:40:02,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2021-12-14 19:40:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 317. [2021-12-14 19:40:02,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 257 states have (on average 1.3073929961089494) internal successors, (336), 307 states have internal predecessors, (336), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 19:40:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 347 transitions. [2021-12-14 19:40:02,991 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 347 transitions. Word has length 49 [2021-12-14 19:40:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:02,991 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 347 transitions. [2021-12-14 19:40:02,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 347 transitions. [2021-12-14 19:40:02,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 19:40:02,991 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:02,992 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:02,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2021-12-14 19:40:03,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2021-12-14 19:40:03,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:40:03,396 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:40:03,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash -694813700, now seen corresponding path program 1 times [2021-12-14 19:40:03,396 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:40:03,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124020731] [2021-12-14 19:40:03,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:03,397 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:40:03,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:40:03,397 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:40:03,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-14 19:40:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:03,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-14 19:40:03,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:40:03,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:40:03,649 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:40:03,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124020731] [2021-12-14 19:40:03,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124020731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:03,649 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:03,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-14 19:40:03,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553417599] [2021-12-14 19:40:03,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:03,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-14 19:40:03,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:40:03,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-14 19:40:03,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-14 19:40:03,650 INFO L87 Difference]: Start difference. First operand 317 states and 347 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:03,875 INFO L93 Difference]: Finished difference Result 316 states and 346 transitions. [2021-12-14 19:40:03,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:40:03,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-12-14 19:40:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:03,876 INFO L225 Difference]: With dead ends: 316 [2021-12-14 19:40:03,876 INFO L226 Difference]: Without dead ends: 316 [2021-12-14 19:40:03,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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:40:03,877 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 140 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:03,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 220 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-14 19:40:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-12-14 19:40:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2021-12-14 19:40:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 257 states have (on average 1.3035019455252919) internal successors, (335), 306 states have internal predecessors, (335), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 19:40:03,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 346 transitions. [2021-12-14 19:40:03,881 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 346 transitions. Word has length 49 [2021-12-14 19:40:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:03,881 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 346 transitions. [2021-12-14 19:40:03,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 346 transitions. [2021-12-14 19:40:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-14 19:40:03,882 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:03,882 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:03,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2021-12-14 19:40:04,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:40:04,090 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:40:04,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash -694813699, now seen corresponding path program 1 times [2021-12-14 19:40:04,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:40:04,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660480896] [2021-12-14 19:40:04,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:04,091 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:40:04,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:40:04,092 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:40:04,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-14 19:40:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:04,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-14 19:40:04,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:40:04,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:40:04,420 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:40:04,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660480896] [2021-12-14 19:40:04,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660480896] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:04,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:04,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-14 19:40:04,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032259478] [2021-12-14 19:40:04,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:04,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-14 19:40:04,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:40:04,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-14 19:40:04,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-14 19:40:04,421 INFO L87 Difference]: Start difference. First operand 316 states and 346 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:04,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:04,708 INFO L93 Difference]: Finished difference Result 307 states and 337 transitions. [2021-12-14 19:40:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-14 19:40:04,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2021-12-14 19:40:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:04,709 INFO L225 Difference]: With dead ends: 307 [2021-12-14 19:40:04,709 INFO L226 Difference]: Without dead ends: 307 [2021-12-14 19:40:04,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:40:04,710 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 151 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:04,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 217 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:40:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2021-12-14 19:40:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2021-12-14 19:40:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 257 states have (on average 1.2684824902723735) internal successors, (326), 297 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 19:40:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 337 transitions. [2021-12-14 19:40:04,714 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 337 transitions. Word has length 49 [2021-12-14 19:40:04,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:04,714 INFO L470 AbstractCegarLoop]: Abstraction has 307 states and 337 transitions. [2021-12-14 19:40:04,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:04,714 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 337 transitions. [2021-12-14 19:40:04,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-14 19:40:04,714 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:04,715 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:04,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-12-14 19:40:04,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:40:04,923 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:40:04,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:04,923 INFO L85 PathProgramCache]: Analyzing trace with hash -64388068, now seen corresponding path program 1 times [2021-12-14 19:40:04,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:40:04,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752221725] [2021-12-14 19:40:04,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:04,923 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:40:04,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:40:04,924 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:40:04,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-14 19:40:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:05,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-14 19:40:05,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:05,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:40:05,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-12-14 19:40:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:40:05,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:40:05,258 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:40:05,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752221725] [2021-12-14 19:40:05,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752221725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:05,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:05,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:40:05,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320120913] [2021-12-14 19:40:05,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:05,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:40:05,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:40:05,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:40:05,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:40:05,259 INFO L87 Difference]: Start difference. First operand 307 states and 337 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:05,584 INFO L93 Difference]: Finished difference Result 328 states and 359 transitions. [2021-12-14 19:40:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:40:05,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-12-14 19:40:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:05,586 INFO L225 Difference]: With dead ends: 328 [2021-12-14 19:40:05,586 INFO L226 Difference]: Without dead ends: 328 [2021-12-14 19:40:05,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:40:05,586 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 199 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:05,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 329 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:40:05,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-12-14 19:40:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 306. [2021-12-14 19:40:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 257 states have (on average 1.264591439688716) internal successors, (325), 296 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 19:40:05,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 336 transitions. [2021-12-14 19:40:05,590 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 336 transitions. Word has length 50 [2021-12-14 19:40:05,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:05,590 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 336 transitions. [2021-12-14 19:40:05,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:05,590 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 336 transitions. [2021-12-14 19:40:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-14 19:40:05,591 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:05,591 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:05,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-12-14 19:40:05,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:40:05,797 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:40:05,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:05,798 INFO L85 PathProgramCache]: Analyzing trace with hash -64388067, now seen corresponding path program 1 times [2021-12-14 19:40:05,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:40:05,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1762994091] [2021-12-14 19:40:05,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:05,798 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:40:05,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:40:05,799 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:40:05,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-12-14 19:40:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:06,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:40:06,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:06,141 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:40:06,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-14 19:40:06,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-12-14 19:40:06,169 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:40:06,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:40:06,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:40:06,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:40:06,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1762994091] [2021-12-14 19:40:06,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1762994091] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:06,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-14 19:40:06,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-14 19:40:06,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063250019] [2021-12-14 19:40:06,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:06,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-14 19:40:06,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:40:06,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-14 19:40:06,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-14 19:40:06,183 INFO L87 Difference]: Start difference. First operand 306 states and 336 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:06,562 INFO L93 Difference]: Finished difference Result 344 states and 375 transitions. [2021-12-14 19:40:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-14 19:40:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2021-12-14 19:40:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:06,563 INFO L225 Difference]: With dead ends: 344 [2021-12-14 19:40:06,563 INFO L226 Difference]: Without dead ends: 344 [2021-12-14 19:40:06,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-14 19:40:06,564 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 285 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:06,564 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 315 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-14 19:40:06,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-12-14 19:40:06,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 305. [2021-12-14 19:40:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 257 states have (on average 1.2607003891050583) internal successors, (324), 295 states have internal predecessors, (324), 3 states have call successors, (3), 3 states have call predecessors, (3), 6 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 19:40:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 335 transitions. [2021-12-14 19:40:06,571 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 335 transitions. Word has length 50 [2021-12-14 19:40:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:06,571 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 335 transitions. [2021-12-14 19:40:06,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 335 transitions. [2021-12-14 19:40:06,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 19:40:06,571 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:06,571 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:06,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2021-12-14 19:40:06,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-14 19:40:06,780 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:40:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1755643938, now seen corresponding path program 1 times [2021-12-14 19:40:06,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:40:06,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607656431] [2021-12-14 19:40:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:06,781 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:40:06,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:40:06,782 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:40:06,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-14 19:40:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:07,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-14 19:40:07,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:07,134 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:40:07,171 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 9 [2021-12-14 19:40:07,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:07,478 INFO L354 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2021-12-14 19:40:07,478 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 2 case distinctions, treesize of input 17 treesize of output 29 [2021-12-14 19:40:07,488 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-14 19:40:07,488 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:40:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:40:07,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-14 19:40:07,830 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-14 19:40:07,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607656431] [2021-12-14 19:40:07,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607656431] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-14 19:40:07,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [903891447] [2021-12-14 19:40:07,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:07,831 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-14 19:40:07,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-14 19:40:07,831 INFO L229 MonitoredProcess]: Starting monitored process 40 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:40:07,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2021-12-14 19:40:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:08,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-14 19:40:08,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:08,257 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:40:08,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:08,298 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:40:08,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-14 19:40:09,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:09,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-14 19:40:09,718 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-14 19:40:09,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2021-12-14 19:40:09,835 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-14 19:40:09,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-14 19:40:09,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [903891447] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-14 19:40:09,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-14 19:40:09,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2021-12-14 19:40:09,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171833537] [2021-12-14 19:40:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-14 19:40:09,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-14 19:40:09,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-14 19:40:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-14 19:40:09,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-12-14 19:40:09,836 INFO L87 Difference]: Start difference. First operand 305 states and 335 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-14 19:40:10,492 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2021-12-14 19:40:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-14 19:40:10,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2021-12-14 19:40:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-14 19:40:10,496 INFO L225 Difference]: With dead ends: 323 [2021-12-14 19:40:10,496 INFO L226 Difference]: Without dead ends: 323 [2021-12-14 19:40:10,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2021-12-14 19:40:10,496 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 16 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-14 19:40:10,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 592 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 125 Unchecked, 0.6s Time] [2021-12-14 19:40:10,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-14 19:40:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 322. [2021-12-14 19:40:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 273 states have (on average 1.2564102564102564) internal successors, (343), 311 states have internal predecessors, (343), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-14 19:40:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 354 transitions. [2021-12-14 19:40:10,500 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 354 transitions. Word has length 51 [2021-12-14 19:40:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-14 19:40:10,500 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 354 transitions. [2021-12-14 19:40:10,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-14 19:40:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 354 transitions. [2021-12-14 19:40:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-12-14 19:40:10,500 INFO L506 BasicCegarLoop]: Found error trace [2021-12-14 19:40:10,501 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-14 19:40:10,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2021-12-14 19:40:10,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2021-12-14 19:40:10,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-14 19:40:10,907 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-14 19:40:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-14 19:40:10,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1755643937, now seen corresponding path program 1 times [2021-12-14 19:40:10,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-14 19:40:10,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274246054] [2021-12-14 19:40:10,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-14 19:40:10,908 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-14 19:40:10,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-14 19:40:10,909 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-14 19:40:10,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-12-14 19:40:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-14 19:40:11,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-14 19:40:11,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-14 19:40:11,221 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:40:11,298 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 9 [2021-12-14 19:40:12,211 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-14 19:40:12,233 INFO L354 Elim1Store]: treesize reduction 42, result has 33.3 percent of original size [2021-12-14 19:40:12,233 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 37 [2021-12-14 19:40:12,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-14 19:40:12,302 INFO L328 TraceCheckSpWp]: Computing backward predicates...