./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 13:07:46,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 13:07:46,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 13:07:46,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 13:07:46,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 13:07:46,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 13:07:46,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 13:07:46,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 13:07:46,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 13:07:46,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 13:07:46,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 13:07:46,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 13:07:46,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 13:07:46,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 13:07:46,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 13:07:46,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 13:07:46,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 13:07:46,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 13:07:46,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 13:07:46,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 13:07:46,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 13:07:46,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 13:07:46,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 13:07:46,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 13:07:46,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 13:07:46,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 13:07:46,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 13:07:46,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 13:07:46,507 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 13:07:46,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 13:07:46,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 13:07:46,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 13:07:46,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 13:07:46,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 13:07:46,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 13:07:46,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 13:07:46,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 13:07:46,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 13:07:46,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 13:07:46,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 13:07:46,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 13:07:46,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 13:07:46,531 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 13:07:46,531 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 13:07:46,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 13:07:46,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 13:07:46,533 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 13:07:46,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 13:07:46,533 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 13:07:46,533 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 13:07:46,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 13:07:46,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 13:07:46,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 13:07:46,534 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 13:07:46,534 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 13:07:46,535 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 13:07:46,535 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 13:07:46,535 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 13:07:46,535 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 13:07:46,535 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 13:07:46,536 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 13:07:46,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 13:07:46,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 13:07:46,536 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 13:07:46,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 13:07:46,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 13:07:46,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 13:07:46,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 13:07:46,538 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 13:07:46,538 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 13:07:46,538 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 13:07:46,538 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 0ecf4b0479dae73c3f7ac0d92b9ed75c6acbf38c Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 13:07:46,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 13:07:46,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 13:07:46,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 13:07:46,885 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 13:07:46,886 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 13:07:46,887 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-21 13:07:46,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664ea8a00/2a5bc953a2474d669f39469245be7f50/FLAGd29ba95ab [2019-11-21 13:07:47,488 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 13:07:47,490 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-21 13:07:47,506 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664ea8a00/2a5bc953a2474d669f39469245be7f50/FLAGd29ba95ab [2019-11-21 13:07:47,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/664ea8a00/2a5bc953a2474d669f39469245be7f50 [2019-11-21 13:07:47,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 13:07:47,792 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 13:07:47,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 13:07:47,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 13:07:47,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 13:07:47,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:07:47" (1/1) ... [2019-11-21 13:07:47,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c177520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:47, skipping insertion in model container [2019-11-21 13:07:47,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:07:47" (1/1) ... [2019-11-21 13:07:47,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 13:07:47,865 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:07:48,233 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:07:48,234 INFO L969 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [545] [2019-11-21 13:07:48,234 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:07:48,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:07:48,313 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 13:07:48,321 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:07:48,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:07:48,404 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 13:07:48,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:07:48,535 INFO L205 MainTranslator]: Completed translation [2019-11-21 13:07:48,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:48 WrapperNode [2019-11-21 13:07:48,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 13:07:48,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 13:07:48,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 13:07:48,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 13:07:48,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:48" (1/1) ... [2019-11-21 13:07:48,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:48" (1/1) ... [2019-11-21 13:07:48,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:48" (1/1) ... [2019-11-21 13:07:48,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:48" (1/1) ... [2019-11-21 13:07:48,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:48" (1/1) ... [2019-11-21 13:07:48,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:48" (1/1) ... [2019-11-21 13:07:48,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:48" (1/1) ... [2019-11-21 13:07:48,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 13:07:48,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 13:07:48,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 13:07:48,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 13:07:48,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 13:07:48,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 13:07:48,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 13:07:48,699 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 13:07:48,700 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 13:07:48,701 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-21 13:07:48,701 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-21 13:07:48,701 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-21 13:07:48,701 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 13:07:48,702 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 13:07:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 13:07:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 13:07:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 13:07:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 13:07:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 13:07:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 13:07:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 13:07:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 13:07:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 13:07:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 13:07:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 13:07:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 13:07:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 13:07:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 13:07:48,707 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 13:07:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 13:07:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 13:07:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 13:07:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 13:07:48,708 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 13:07:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 13:07:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 13:07:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 13:07:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 13:07:48,709 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 13:07:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 13:07:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 13:07:48,710 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 13:07:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 13:07:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 13:07:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 13:07:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 13:07:48,711 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 13:07:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 13:07:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 13:07:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 13:07:48,712 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 13:07:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 13:07:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 13:07:48,713 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 13:07:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 13:07:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 13:07:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 13:07:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 13:07:48,714 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 13:07:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 13:07:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 13:07:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 13:07:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 13:07:48,715 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 13:07:48,716 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 13:07:48,716 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 13:07:48,717 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 13:07:48,717 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 13:07:48,717 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 13:07:48,718 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 13:07:48,719 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 13:07:48,719 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 13:07:48,721 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 13:07:48,721 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 13:07:48,721 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 13:07:48,721 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 13:07:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 13:07:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 13:07:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 13:07:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 13:07:48,722 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 13:07:48,723 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 13:07:48,724 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 13:07:48,724 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 13:07:48,724 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 13:07:48,724 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 13:07:48,724 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 13:07:48,725 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 13:07:48,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 13:07:48,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 13:07:48,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 13:07:48,725 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 13:07:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 13:07:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 13:07:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 13:07:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 13:07:48,726 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 13:07:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 13:07:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 13:07:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 13:07:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 13:07:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 13:07:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 13:07:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 13:07:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 13:07:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 13:07:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 13:07:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 13:07:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 13:07:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 13:07:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 13:07:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 13:07:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 13:07:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 13:07:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 13:07:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 13:07:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 13:07:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 13:07:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 13:07:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 13:07:48,731 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-21 13:07:48,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 13:07:48,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 13:07:48,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 13:07:48,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 13:07:48,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 13:07:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-21 13:07:48,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 13:07:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-21 13:07:48,738 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 13:07:48,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 13:07:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 13:07:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 13:07:48,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 13:07:49,954 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 13:07:49,954 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-21 13:07:49,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:07:49 BoogieIcfgContainer [2019-11-21 13:07:49,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 13:07:49,957 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 13:07:49,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 13:07:49,960 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 13:07:49,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:07:47" (1/3) ... [2019-11-21 13:07:49,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a12b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:07:49, skipping insertion in model container [2019-11-21 13:07:49,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:07:48" (2/3) ... [2019-11-21 13:07:49,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a12b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:07:49, skipping insertion in model container [2019-11-21 13:07:49,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:07:49" (3/3) ... [2019-11-21 13:07:49,964 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-21 13:07:49,973 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 13:07:49,979 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-21 13:07:49,988 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-21 13:07:50,009 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 13:07:50,009 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 13:07:50,009 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 13:07:50,010 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 13:07:50,010 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 13:07:50,010 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 13:07:50,010 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 13:07:50,011 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 13:07:50,033 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-21 13:07:50,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 13:07:50,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:07:50,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:07:50,044 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:07:50,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:07:50,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1987159451, now seen corresponding path program 1 times [2019-11-21 13:07:50,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:07:50,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1649196781] [2019-11-21 13:07:50,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:07:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:07:50,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 13:07:50,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:07:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:07:50,321 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:07:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:07:50,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1649196781] [2019-11-21 13:07:50,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:07:50,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 13:07:50,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386704640] [2019-11-21 13:07:50,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 13:07:50,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:07:50,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 13:07:50,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 13:07:50,368 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-21 13:07:50,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:07:50,426 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-21 13:07:50,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 13:07:50,428 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-21 13:07:50,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:07:50,455 INFO L225 Difference]: With dead ends: 199 [2019-11-21 13:07:50,455 INFO L226 Difference]: Without dead ends: 196 [2019-11-21 13:07:50,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 13:07:50,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-21 13:07:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-21 13:07:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-21 13:07:50,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-21 13:07:50,520 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-21 13:07:50,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:07:50,520 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-21 13:07:50,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 13:07:50,520 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-21 13:07:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 13:07:50,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:07:50,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:07:50,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:07:50,733 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:07:50,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:07:50,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1472314630, now seen corresponding path program 1 times [2019-11-21 13:07:50,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:07:50,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1125008155] [2019-11-21 13:07:50,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:07:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:07:50,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 13:07:50,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:07:51,007 INFO L377 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 [2019-11-21 13:07:51,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:07:51,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:07:51,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:07:51,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:07:51,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:07:51,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-21 13:07:51,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:07:51,102 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 13:07:51,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:07:51,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 13:07:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:07:51,123 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:07:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:07:51,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1125008155] [2019-11-21 13:07:51,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:07:51,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 13:07:51,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303126076] [2019-11-21 13:07:51,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 13:07:51,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:07:51,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 13:07:51,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 13:07:51,190 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 8 states. [2019-11-21 13:07:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:07:52,466 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2019-11-21 13:07:52,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 13:07:52,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 13:07:52,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:07:52,469 INFO L225 Difference]: With dead ends: 190 [2019-11-21 13:07:52,469 INFO L226 Difference]: Without dead ends: 190 [2019-11-21 13:07:52,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-21 13:07:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-21 13:07:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-11-21 13:07:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-21 13:07:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 201 transitions. [2019-11-21 13:07:52,484 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 201 transitions. Word has length 9 [2019-11-21 13:07:52,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:07:52,484 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 201 transitions. [2019-11-21 13:07:52,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 13:07:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 201 transitions. [2019-11-21 13:07:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 13:07:52,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:07:52,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:07:52,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:07:52,697 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:07:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:07:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1472314629, now seen corresponding path program 1 times [2019-11-21 13:07:52,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:07:52,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1955589690] [2019-11-21 13:07:52,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:07:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:07:52,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 13:07:52,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:07:52,911 INFO L377 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 [2019-11-21 13:07:52,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:07:52,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:07:52,930 INFO L377 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 [2019-11-21 13:07:52,931 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:07:52,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:07:52,944 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:07:52,944 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 13:07:52,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:07:52,990 INFO L377 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 [2019-11-21 13:07:52,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:07:53,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:07:53,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:07:53,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 13:07:53,021 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:07:53,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:07:53,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:07:53,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-21 13:07:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:07:53,063 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:07:53,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:07:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:07:53,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1955589690] [2019-11-21 13:07:53,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:07:53,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 13:07:53,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59364505] [2019-11-21 13:07:53,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 13:07:53,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:07:53,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 13:07:53,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 13:07:53,399 INFO L87 Difference]: Start difference. First operand 190 states and 201 transitions. Second operand 8 states. [2019-11-21 13:07:58,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:07:58,688 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-11-21 13:07:58,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 13:07:58,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 13:07:58,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:07:58,693 INFO L225 Difference]: With dead ends: 205 [2019-11-21 13:07:58,693 INFO L226 Difference]: Without dead ends: 205 [2019-11-21 13:07:58,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-21 13:07:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-21 13:07:58,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-21 13:07:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-21 13:07:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2019-11-21 13:07:58,709 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 9 [2019-11-21 13:07:58,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:07:58,709 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2019-11-21 13:07:58,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 13:07:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2019-11-21 13:07:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 13:07:58,710 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:07:58,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:07:58,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:07:58,914 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:07:58,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:07:58,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1602886942, now seen corresponding path program 1 times [2019-11-21 13:07:58,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:07:58,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [915915362] [2019-11-21 13:07:58,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:07:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:07:59,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 13:07:59,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:07:59,120 INFO L377 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 [2019-11-21 13:07:59,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:07:59,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:07:59,123 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:07:59,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:07:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:07:59,137 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:07:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:07:59,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [915915362] [2019-11-21 13:07:59,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:07:59,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-21 13:07:59,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689286243] [2019-11-21 13:07:59,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 13:07:59,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:07:59,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 13:07:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:07:59,160 INFO L87 Difference]: Start difference. First operand 188 states and 199 transitions. Second operand 4 states. [2019-11-21 13:07:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:07:59,541 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2019-11-21 13:07:59,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 13:07:59,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 13:07:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:07:59,544 INFO L225 Difference]: With dead ends: 186 [2019-11-21 13:07:59,544 INFO L226 Difference]: Without dead ends: 186 [2019-11-21 13:07:59,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:07:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-21 13:07:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-21 13:07:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-21 13:07:59,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 197 transitions. [2019-11-21 13:07:59,554 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 197 transitions. Word has length 10 [2019-11-21 13:07:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:07:59,555 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 197 transitions. [2019-11-21 13:07:59,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 13:07:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 197 transitions. [2019-11-21 13:07:59,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 13:07:59,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:07:59,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:07:59,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:07:59,760 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:07:59,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:07:59,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1602886943, now seen corresponding path program 1 times [2019-11-21 13:07:59,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:07:59,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1466519386] [2019-11-21 13:07:59,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:07:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:07:59,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:07:59,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:07:59,950 INFO L377 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 [2019-11-21 13:07:59,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:07:59,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:07:59,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:07:59,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 13:07:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:07:59,970 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:08:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:00,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1466519386] [2019-11-21 13:08:00,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:08:00,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 13:08:00,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095580864] [2019-11-21 13:08:00,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 13:08:00,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:08:00,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 13:08:00,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:08:00,014 INFO L87 Difference]: Start difference. First operand 186 states and 197 transitions. Second operand 4 states. [2019-11-21 13:08:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:08:00,744 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2019-11-21 13:08:00,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 13:08:00,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 13:08:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:08:00,747 INFO L225 Difference]: With dead ends: 184 [2019-11-21 13:08:00,747 INFO L226 Difference]: Without dead ends: 184 [2019-11-21 13:08:00,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:08:00,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-21 13:08:00,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-21 13:08:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-21 13:08:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2019-11-21 13:08:00,756 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 10 [2019-11-21 13:08:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:08:00,756 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2019-11-21 13:08:00,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 13:08:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2019-11-21 13:08:00,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 13:08:00,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:08:00,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:08:00,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:00,960 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:08:00,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:08:00,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2098788692, now seen corresponding path program 1 times [2019-11-21 13:08:00,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:08:00,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1076143690] [2019-11-21 13:08:00,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:08:01,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-21 13:08:01,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:08:01,175 INFO L377 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 [2019-11-21 13:08:01,175 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:01,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:01,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:01,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-11-21 13:08:01,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:01,237 INFO L377 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 13 treesize of output 17 [2019-11-21 13:08:01,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:01,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:01,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:01,248 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2019-11-21 13:08:01,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 13:08:01,296 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:01,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:01,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 13:08:01,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:01,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:01,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:01,357 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:18 [2019-11-21 13:08:01,390 INFO L377 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 [2019-11-21 13:08:01,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:01,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:01,403 INFO L377 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 [2019-11-21 13:08:01,404 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:01,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:01,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:01,408 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-21 13:08:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:01,422 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:08:01,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:01,844 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 13:08:05,986 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-21 13:08:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:06,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1076143690] [2019-11-21 13:08:06,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:08:06,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-21 13:08:06,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789719788] [2019-11-21 13:08:06,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 13:08:06,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:08:06,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 13:08:06,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=83, Unknown=1, NotChecked=0, Total=110 [2019-11-21 13:08:06,012 INFO L87 Difference]: Start difference. First operand 184 states and 195 transitions. Second operand 11 states. [2019-11-21 13:08:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:08:07,588 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2019-11-21 13:08:07,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 13:08:07,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-21 13:08:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:08:07,591 INFO L225 Difference]: With dead ends: 192 [2019-11-21 13:08:07,591 INFO L226 Difference]: Without dead ends: 192 [2019-11-21 13:08:07,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2019-11-21 13:08:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-21 13:08:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-11-21 13:08:07,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-21 13:08:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2019-11-21 13:08:07,617 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 15 [2019-11-21 13:08:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:08:07,619 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2019-11-21 13:08:07,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 13:08:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2019-11-21 13:08:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 13:08:07,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:08:07,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:08:07,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:07,826 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:08:07,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:08:07,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1692710809, now seen corresponding path program 1 times [2019-11-21 13:08:07,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:08:07,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2126349556] [2019-11-21 13:08:07,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:08:08,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 13:08:08,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:08:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:08,084 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:08:08,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:08,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2126349556] [2019-11-21 13:08:08,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:08:08,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 13:08:08,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423199304] [2019-11-21 13:08:08,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 13:08:08,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:08:08,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 13:08:08,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:08:08,122 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 4 states. [2019-11-21 13:08:08,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:08:08,168 INFO L93 Difference]: Finished difference Result 268 states and 284 transitions. [2019-11-21 13:08:08,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:08:08,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-21 13:08:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:08:08,170 INFO L225 Difference]: With dead ends: 268 [2019-11-21 13:08:08,171 INFO L226 Difference]: Without dead ends: 268 [2019-11-21 13:08:08,172 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:08:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-21 13:08:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2019-11-21 13:08:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-21 13:08:08,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2019-11-21 13:08:08,187 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 17 [2019-11-21 13:08:08,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:08:08,187 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2019-11-21 13:08:08,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 13:08:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2019-11-21 13:08:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 13:08:08,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:08:08,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:08:08,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:08,395 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:08:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:08:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash 934433737, now seen corresponding path program 1 times [2019-11-21 13:08:08,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:08:08,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [20762660] [2019-11-21 13:08:08,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:08:08,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:08:08,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:08:08,643 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 13:08:08,644 INFO L377 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 19 treesize of output 18 [2019-11-21 13:08:08,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:08,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:08,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:08:08,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-21 13:08:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:08,672 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:08:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:08,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [20762660] [2019-11-21 13:08:08,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:08:08,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 13:08:08,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229003042] [2019-11-21 13:08:08,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 13:08:08,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:08:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 13:08:08,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:08:08,689 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand 4 states. [2019-11-21 13:08:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:08:09,383 INFO L93 Difference]: Finished difference Result 260 states and 314 transitions. [2019-11-21 13:08:09,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 13:08:09,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 13:08:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:08:09,385 INFO L225 Difference]: With dead ends: 260 [2019-11-21 13:08:09,386 INFO L226 Difference]: Without dead ends: 260 [2019-11-21 13:08:09,386 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:08:09,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-21 13:08:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 226. [2019-11-21 13:08:09,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-21 13:08:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 274 transitions. [2019-11-21 13:08:09,394 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 274 transitions. Word has length 18 [2019-11-21 13:08:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:08:09,394 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 274 transitions. [2019-11-21 13:08:09,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 13:08:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 274 transitions. [2019-11-21 13:08:09,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 13:08:09,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:08:09,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:08:09,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:09,596 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:08:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:08:09,596 INFO L82 PathProgramCache]: Analyzing trace with hash 934433738, now seen corresponding path program 1 times [2019-11-21 13:08:09,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:08:09,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [325308852] [2019-11-21 13:08:09,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:08:09,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 13:08:09,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:08:09,847 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_112|], 1=[|v_#valid_160|]} [2019-11-21 13:08:09,853 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:08:09,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 13:08:09,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:09,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:09,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:08:09,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 13:08:09,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:09,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:09,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:08:09,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-21 13:08:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:09,906 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:08:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:09,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [325308852] [2019-11-21 13:08:09,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:08:09,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 13:08:09,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305858266] [2019-11-21 13:08:09,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 13:08:09,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:08:09,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 13:08:09,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:08:09,956 INFO L87 Difference]: Start difference. First operand 226 states and 274 transitions. Second operand 4 states. [2019-11-21 13:08:10,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:08:10,688 INFO L93 Difference]: Finished difference Result 251 states and 296 transitions. [2019-11-21 13:08:10,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 13:08:10,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 13:08:10,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:08:10,691 INFO L225 Difference]: With dead ends: 251 [2019-11-21 13:08:10,691 INFO L226 Difference]: Without dead ends: 251 [2019-11-21 13:08:10,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 13:08:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-21 13:08:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2019-11-21 13:08:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-21 13:08:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2019-11-21 13:08:10,698 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 18 [2019-11-21 13:08:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:08:10,698 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-11-21 13:08:10,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 13:08:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2019-11-21 13:08:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 13:08:10,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:08:10,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:08:10,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:10,900 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:08:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:08:10,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1419279948, now seen corresponding path program 1 times [2019-11-21 13:08:10,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:08:10,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [742513637] [2019-11-21 13:08:10,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:08:11,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:08:11,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:08:11,145 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 13:08:11,146 INFO L377 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 11 [2019-11-21 13:08:11,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:11,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:11,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:08:11,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-21 13:08:11,177 INFO L377 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 [2019-11-21 13:08:11,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:11,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:11,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:11,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-21 13:08:11,201 INFO L377 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 [2019-11-21 13:08:11,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:11,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:11,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:11,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-21 13:08:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:11,216 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:08:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:11,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [742513637] [2019-11-21 13:08:11,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:08:11,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 13:08:11,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771969777] [2019-11-21 13:08:11,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:08:11,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:08:11,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:08:11,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:08:11,233 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. Second operand 5 states. [2019-11-21 13:08:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:08:11,960 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-21 13:08:11,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:08:11,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 13:08:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:08:11,964 INFO L225 Difference]: With dead ends: 226 [2019-11-21 13:08:11,964 INFO L226 Difference]: Without dead ends: 226 [2019-11-21 13:08:11,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-21 13:08:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-21 13:08:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2019-11-21 13:08:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-21 13:08:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2019-11-21 13:08:11,972 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 22 [2019-11-21 13:08:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:08:11,972 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2019-11-21 13:08:11,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:08:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2019-11-21 13:08:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 13:08:11,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:08:11,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:08:12,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:12,177 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:08:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:08:12,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1419279947, now seen corresponding path program 1 times [2019-11-21 13:08:12,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:08:12,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [963930355] [2019-11-21 13:08:12,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:08:12,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 13:08:12,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:08:12,441 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:12,441 INFO L377 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 13:08:12,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:12,470 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-21 13:08:12,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:12,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-21 13:08:12,491 INFO L377 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 [2019-11-21 13:08:12,492 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:12,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:12,509 INFO L377 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 [2019-11-21 13:08:12,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:12,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:12,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:12,521 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2019-11-21 13:08:12,566 INFO L377 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 [2019-11-21 13:08:12,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:12,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:12,583 INFO L377 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 [2019-11-21 13:08:12,584 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:12,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:12,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:12,592 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:14 [2019-11-21 13:08:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:12,608 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:08:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:08:12,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [963930355] [2019-11-21 13:08:12,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:08:12,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 13:08:12,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595377900] [2019-11-21 13:08:12,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 13:08:12,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:08:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 13:08:12,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-21 13:08:12,929 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand 10 states. [2019-11-21 13:08:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:08:16,233 INFO L93 Difference]: Finished difference Result 318 states and 374 transitions. [2019-11-21 13:08:16,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 13:08:16,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 13:08:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:08:16,237 INFO L225 Difference]: With dead ends: 318 [2019-11-21 13:08:16,237 INFO L226 Difference]: Without dead ends: 318 [2019-11-21 13:08:16,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-11-21 13:08:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-21 13:08:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 232. [2019-11-21 13:08:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-21 13:08:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 272 transitions. [2019-11-21 13:08:16,246 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 272 transitions. Word has length 22 [2019-11-21 13:08:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:08:16,246 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 272 transitions. [2019-11-21 13:08:16,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 13:08:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 272 transitions. [2019-11-21 13:08:16,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 13:08:16,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:08:16,248 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:08:16,451 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:16,451 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr25REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr24REQUIRES_VIOLATION, create_dataErr22REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr23REQUIRES_VIOLATION, create_dataErr21REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr30REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr31REQUIRES_VIOLATION, create_dataErr29REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr28REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr26REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, create_dataErr27REQUIRES_VIOLATION, create_dataErr14REQUIRES_VIOLATION, create_dataErr15REQUIRES_VIOLATION, create_dataErr36REQUIRES_VIOLATION, create_dataErr13REQUIRES_VIOLATION, create_dataErr34REQUIRES_VIOLATION, create_dataErr35REQUIRES_VIOLATION, create_dataErr33REQUIRES_VIOLATION, create_dataErr12REQUIRES_VIOLATION, create_dataErr10REQUIRES_VIOLATION, create_dataErr32REQUIRES_VIOLATION, create_dataErr11REQUIRES_VIOLATION, create_dataErr20REQUIRES_VIOLATION, create_dataErr18REQUIRES_VIOLATION, create_dataErr19REQUIRES_VIOLATION, create_dataErr17REQUIRES_VIOLATION, create_dataErr38REQUIRES_VIOLATION, create_dataErr39REQUIRES_VIOLATION, create_dataErr37REQUIRES_VIOLATION, create_dataErr16REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr2ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3ASSERT_VIOLATIONMEMORY_FREE, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION]=== [2019-11-21 13:08:16,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:08:16,452 INFO L82 PathProgramCache]: Analyzing trace with hash 454608501, now seen corresponding path program 1 times [2019-11-21 13:08:16,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:08:16,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1308424596] [2019-11-21 13:08:16,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:08:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:08:16,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 13:08:16,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:08:16,864 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_174|]} [2019-11-21 13:08:16,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:08:16,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 13:08:16,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:16,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:16,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:08:16,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 13:08:16,892 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:16,899 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:16,900 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:16,900 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-21 13:08:16,919 INFO L377 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 [2019-11-21 13:08:16,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:16,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:16,963 INFO L377 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 [2019-11-21 13:08:16,963 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:16,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:16,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:08:16,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:26 [2019-11-21 13:08:17,157 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:17,158 INFO L377 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 95 treesize of output 107 [2019-11-21 13:08:17,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:08:17,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:17,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:17,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-21 13:08:17,316 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-11-21 13:08:17,318 INFO L567 ElimStorePlain]: treesize reduction 258, result has 22.1 percent of original size [2019-11-21 13:08:17,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:08:17,332 INFO L377 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 52 treesize of output 45 [2019-11-21 13:08:17,333 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:17,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:17,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:08:17,366 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:112, output treesize:63 [2019-11-21 13:08:23,421 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-21 13:08:25,477 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 13:08:27,583 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 13:08:27,618 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_71|], 12=[|v_#memory_$Pointer$.offset_70|]} [2019-11-21 13:08:27,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:27,665 INFO L377 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 131 treesize of output 133 [2019-11-21 13:08:27,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:08:27,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:27,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:27,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:27,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-21 13:08:27,977 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-11-21 13:08:27,978 INFO L567 ElimStorePlain]: treesize reduction 473, result has 22.8 percent of original size [2019-11-21 13:08:27,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:08:28,208 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-21 13:08:28,208 INFO L343 Elim1Store]: treesize reduction 18, result has 89.8 percent of original size [2019-11-21 13:08:28,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 206 [2019-11-21 13:08:28,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:28,210 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:08:42,408 WARN L192 SmtUtils]: Spent 14.20 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 13:08:42,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:08:42,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:08:42,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:42,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:42,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:42,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:42,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 13:08:42,416 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:150, output treesize:251 [2019-11-21 13:08:42,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:08:42,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:42,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:42,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:42,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:48,551 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 62 [2019-11-21 13:08:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:08:48,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:48,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:48,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:08:48,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:10:22,446 WARN L192 SmtUtils]: Spent 1.43 m on a formula simplification that was a NOOP. DAG size: 78 [2019-11-21 13:13:52,875 WARN L192 SmtUtils]: Spent 3.50 m on a formula simplification. DAG size of input: 154 DAG size of output: 117 [2019-11-21 13:13:52,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 13:13:52,900 INFO L392 ElimStorePlain]: Different costs {72=[|#memory_$Pointer$.base|], 210=[|#memory_$Pointer$.offset|]} [2019-11-21 13:13:52,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:53,040 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:13:53,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 152 [2019-11-21 13:13:53,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:13:53,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:13:53,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:53,177 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:13:53,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 137 [2019-11-21 13:13:53,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:13:53,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:13:53,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:53,320 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:13:53,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 152 [2019-11-21 13:13:53,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:13:53,322 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 13:13:53,442 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-21 13:13:53,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 117 treesize of output 104 [2019-11-21 13:13:53,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:13:53,444 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 13:13:53,908 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-11-21 13:13:53,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:13:53,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:53,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:53,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:53,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,045 INFO L237 Elim1Store]: Index analysis took 106 ms [2019-11-21 13:13:54,083 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:13:54,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 93 [2019-11-21 13:13:54,084 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 13:13:54,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,228 INFO L237 Elim1Store]: Index analysis took 120 ms [2019-11-21 13:13:54,261 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:13:54,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 75 [2019-11-21 13:13:54,262 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 13:13:54,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,294 INFO L343 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2019-11-21 13:13:54,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 27 [2019-11-21 13:13:54,295 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 13:13:54,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:13:54,419 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:13:54,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 60 [2019-11-21 13:13:54,421 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 13:13:54,489 INFO L567 ElimStorePlain]: treesize reduction 88, result has 19.3 percent of original size [2019-11-21 13:13:54,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:13:54,490 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:658, output treesize:21 [2019-11-21 13:13:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:13:54,587 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:13:55,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:13:55,165 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:13:55,182 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:13:55,204 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:13:55,468 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 13:13:55,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:13:55,490 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:13:55,513 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:13:55,536 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:13:55,840 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-21 13:13:55,840 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:13:55,841 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-11-21 13:13:55,842 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:215, output treesize:250 [2019-11-21 13:14:00,819 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-21 13:14:12,934 WARN L192 SmtUtils]: Spent 2.60 s on a formula simplification that was a NOOP. DAG size: 86 [2019-11-21 13:14:26,050 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-21 13:14:26,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:14:26,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:14:26,280 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 13:14:26,287 INFO L168 Benchmark]: Toolchain (without parser) took 398495.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.3 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -73.6 MB). Peak memory consumption was 234.7 MB. Max. memory is 11.5 GB. [2019-11-21 13:14:26,287 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:14:26,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 743.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -128.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-21 13:14:26,288 INFO L168 Benchmark]: Boogie Preprocessor took 100.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:14:26,289 INFO L168 Benchmark]: RCFGBuilder took 1318.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.7 MB). Peak memory consumption was 85.7 MB. Max. memory is 11.5 GB. [2019-11-21 13:14:26,289 INFO L168 Benchmark]: TraceAbstraction took 396328.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 189.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -30.5 MB). Peak memory consumption was 158.8 MB. Max. memory is 11.5 GB. [2019-11-21 13:14:26,291 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 743.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -128.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1318.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.7 MB). Peak memory consumption was 85.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 396328.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 189.3 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -30.5 MB). Peak memory consumption was 158.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...