./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 64bit -------------------------------------------------------------------------------- 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-64bit-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 64bit --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 11:51:23,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 11:51:23,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 11:51:23,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 11:51:23,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 11:51:23,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 11:51:23,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 11:51:23,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 11:51:23,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 11:51:23,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 11:51:23,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 11:51:23,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 11:51:23,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 11:51:23,196 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 11:51:23,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 11:51:23,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 11:51:23,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 11:51:23,200 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 11:51:23,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 11:51:23,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 11:51:23,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 11:51:23,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 11:51:23,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 11:51:23,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 11:51:23,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 11:51:23,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 11:51:23,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 11:51:23,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 11:51:23,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 11:51:23,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 11:51:23,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 11:51:23,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 11:51:23,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 11:51:23,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 11:51:23,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 11:51:23,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 11:51:23,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 11:51:23,220 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 11:51:23,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 11:51:23,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 11:51:23,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 11:51:23,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-21 11:51:23,237 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 11:51:23,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 11:51:23,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 11:51:23,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 11:51:23,240 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 11:51:23,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 11:51:23,240 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 11:51:23,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 11:51:23,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 11:51:23,241 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 11:51:23,241 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 11:51:23,241 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 11:51:23,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 11:51:23,242 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 11:51:23,242 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 11:51:23,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 11:51:23,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 11:51:23,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 11:51:23,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 11:51:23,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 11:51:23,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 11:51:23,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 11:51:23,245 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 11:51:23,245 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 11:51:23,245 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 11:51:23,246 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 11:51:23,246 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 -> 64bit 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 11:51:23,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 11:51:23,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 11:51:23,618 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 11:51:23,619 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 11:51:23,620 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 11:51:23,621 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 11:51:23,681 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce463df78/2373ecaee3ef426a89046f52fc71adb0/FLAG93f905781 [2019-11-21 11:51:24,157 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 11:51:24,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2019-11-21 11:51:24,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce463df78/2373ecaee3ef426a89046f52fc71adb0/FLAG93f905781 [2019-11-21 11:51:24,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce463df78/2373ecaee3ef426a89046f52fc71adb0 [2019-11-21 11:51:24,497 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 11:51:24,498 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 11:51:24,499 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 11:51:24,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 11:51:24,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 11:51:24,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:51:24" (1/1) ... [2019-11-21 11:51:24,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cdc8ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:24, skipping insertion in model container [2019-11-21 11:51:24,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:51:24" (1/1) ... [2019-11-21 11:51:24,517 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 11:51:24,582 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:51:24,921 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 11:51:24,922 INFO L969 CHandler]: at location: C: (int*) malloc(20 * sizeof(data->array)) [545] [2019-11-21 11:51:24,922 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:51:24,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:51:24,977 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 11:51:24,987 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:51:25,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:51:25,091 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 11:51:25,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:51:25,202 INFO L205 MainTranslator]: Completed translation [2019-11-21 11:51:25,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:25 WrapperNode [2019-11-21 11:51:25,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 11:51:25,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 11:51:25,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 11:51:25,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 11:51:25,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:25" (1/1) ... [2019-11-21 11:51:25,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:25" (1/1) ... [2019-11-21 11:51:25,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:25" (1/1) ... [2019-11-21 11:51:25,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:25" (1/1) ... [2019-11-21 11:51:25,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:25" (1/1) ... [2019-11-21 11:51:25,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:25" (1/1) ... [2019-11-21 11:51:25,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:25" (1/1) ... [2019-11-21 11:51:25,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 11:51:25,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 11:51:25,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 11:51:25,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 11:51:25,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:25" (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 11:51:25,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 11:51:25,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 11:51:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 11:51:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 11:51:25,445 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-21 11:51:25,446 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-21 11:51:25,446 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-21 11:51:25,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 11:51:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 11:51:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 11:51:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 11:51:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 11:51:25,448 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 11:51:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 11:51:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 11:51:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 11:51:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 11:51:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 11:51:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 11:51:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 11:51:25,450 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 11:51:25,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 11:51:25,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 11:51:25,452 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 11:51:25,452 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 11:51:25,452 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 11:51:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 11:51:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 11:51:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 11:51:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 11:51:25,453 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 11:51:25,454 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 11:51:25,454 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 11:51:25,454 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 11:51:25,454 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 11:51:25,455 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 11:51:25,456 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 11:51:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 11:51:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 11:51:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 11:51:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 11:51:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 11:51:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 11:51:25,458 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 11:51:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 11:51:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 11:51:25,459 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 11:51:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 11:51:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 11:51:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 11:51:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 11:51:25,460 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 11:51:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 11:51:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 11:51:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 11:51:25,461 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 11:51:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 11:51:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 11:51:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 11:51:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 11:51:25,462 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 11:51:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 11:51:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 11:51:25,463 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 11:51:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 11:51:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 11:51:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 11:51:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 11:51:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 11:51:25,466 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 11:51:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 11:51:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 11:51:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 11:51:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 11:51:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 11:51:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 11:51:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 11:51:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 11:51:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 11:51:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 11:51:25,469 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 11:51:25,470 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 11:51:25,470 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 11:51:25,470 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 11:51:25,470 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 11:51:25,470 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 11:51:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 11:51:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 11:51:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 11:51:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 11:51:25,471 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 11:51:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 11:51:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 11:51:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 11:51:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 11:51:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 11:51:25,472 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 11:51:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 11:51:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 11:51:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 11:51:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 11:51:25,473 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 11:51:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 11:51:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 11:51:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 11:51:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 11:51:25,474 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 11:51:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 11:51:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 11:51:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 11:51:25,475 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 11:51:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 11:51:25,476 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 11:51:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 11:51:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 11:51:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-21 11:51:25,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 11:51:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 11:51:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 11:51:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 11:51:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 11:51:25,478 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-21 11:51:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 11:51:25,479 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-21 11:51:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 11:51:25,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 11:51:25,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 11:51:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 11:51:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 11:51:26,758 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 11:51:26,758 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-21 11:51:26,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:51:26 BoogieIcfgContainer [2019-11-21 11:51:26,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 11:51:26,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 11:51:26,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 11:51:26,768 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 11:51:26,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:51:24" (1/3) ... [2019-11-21 11:51:26,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b51767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:51:26, skipping insertion in model container [2019-11-21 11:51:26,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:51:25" (2/3) ... [2019-11-21 11:51:26,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b51767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:51:26, skipping insertion in model container [2019-11-21 11:51:26,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:51:26" (3/3) ... [2019-11-21 11:51:26,781 INFO L109 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2019-11-21 11:51:26,792 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 11:51:26,802 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 92 error locations. [2019-11-21 11:51:26,815 INFO L249 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2019-11-21 11:51:26,837 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 11:51:26,837 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 11:51:26,837 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 11:51:26,837 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 11:51:26,838 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 11:51:26,838 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 11:51:26,838 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 11:51:26,838 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 11:51:26,860 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-11-21 11:51:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 11:51:26,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:26,870 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:51:26,871 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 11:51:26,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:26,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1987159451, now seen corresponding path program 1 times [2019-11-21 11:51:26,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:26,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2089774475] [2019-11-21 11:51:26,890 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 11:51:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:27,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-21 11:51:27,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:27,129 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 11:51:27,130 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:27,148 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 11:51:27,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2089774475] [2019-11-21 11:51:27,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:27,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 11:51:27,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770677919] [2019-11-21 11:51:27,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-21 11:51:27,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:27,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-21 11:51:27,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-21 11:51:27,176 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 2 states. [2019-11-21 11:51:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:27,211 INFO L93 Difference]: Finished difference Result 199 states and 210 transitions. [2019-11-21 11:51:27,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-21 11:51:27,212 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-21 11:51:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:27,226 INFO L225 Difference]: With dead ends: 199 [2019-11-21 11:51:27,227 INFO L226 Difference]: Without dead ends: 196 [2019-11-21 11:51:27,229 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 11:51:27,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-21 11:51:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-11-21 11:51:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-11-21 11:51:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 207 transitions. [2019-11-21 11:51:27,294 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 207 transitions. Word has length 8 [2019-11-21 11:51:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:27,295 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 207 transitions. [2019-11-21 11:51:27,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-21 11:51:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 207 transitions. [2019-11-21 11:51:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 11:51:27,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:27,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:51:27,500 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:27,501 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 11:51:27,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:27,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1472314630, now seen corresponding path program 1 times [2019-11-21 11:51:27,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:27,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [980036012] [2019-11-21 11:51:27,502 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 11:51:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:27,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 11:51:27,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:27,762 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 11:51:27,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:27,771 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:27,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:51:27,772 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:51:27,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:27,838 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 11:51:27,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:27,866 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 11:51:27,867 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 11:51:27,868 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 11:51:27,889 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 11:51:27,890 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:27,965 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 11:51:27,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980036012] [2019-11-21 11:51:27,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:27,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 11:51:27,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345313817] [2019-11-21 11:51:27,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 11:51:27,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 11:51:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 11:51:27,969 INFO L87 Difference]: Start difference. First operand 196 states and 207 transitions. Second operand 8 states. [2019-11-21 11:51:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:29,253 INFO L93 Difference]: Finished difference Result 190 states and 201 transitions. [2019-11-21 11:51:29,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:51:29,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 11:51:29,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:29,257 INFO L225 Difference]: With dead ends: 190 [2019-11-21 11:51:29,257 INFO L226 Difference]: Without dead ends: 190 [2019-11-21 11:51:29,258 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 11:51:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-21 11:51:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-11-21 11:51:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-21 11:51:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 201 transitions. [2019-11-21 11:51:29,272 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 201 transitions. Word has length 9 [2019-11-21 11:51:29,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:29,273 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 201 transitions. [2019-11-21 11:51:29,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 11:51:29,273 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 201 transitions. [2019-11-21 11:51:29,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 11:51:29,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:29,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:51:29,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:29,479 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 11:51:29,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:29,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1472314629, now seen corresponding path program 1 times [2019-11-21 11:51:29,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:29,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1981545335] [2019-11-21 11:51:29,482 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 11:51:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:29,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 11:51:29,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:29,712 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 11:51:29,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:29,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:29,733 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 11:51:29,733 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:29,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:29,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:51:29,745 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 11:51:29,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:51:29,794 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 14 treesize of output 16 [2019-11-21 11:51:29,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:29,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:29,814 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:51:29,815 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 11:51:29,816 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:29,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:29,827 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 11:51:29,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2019-11-21 11:51:29,846 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 11:51:29,846 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:29,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:51:30,197 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 11:51:30,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1981545335] [2019-11-21 11:51:30,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:30,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 11:51:30,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091601061] [2019-11-21 11:51:30,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 11:51:30,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:30,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 11:51:30,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 11:51:30,199 INFO L87 Difference]: Start difference. First operand 190 states and 201 transitions. Second operand 8 states. [2019-11-21 11:51:39,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:39,126 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2019-11-21 11:51:39,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 11:51:39,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 11:51:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:39,131 INFO L225 Difference]: With dead ends: 205 [2019-11-21 11:51:39,131 INFO L226 Difference]: Without dead ends: 205 [2019-11-21 11:51:39,132 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 11:51:39,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-21 11:51:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 188. [2019-11-21 11:51:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-21 11:51:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 199 transitions. [2019-11-21 11:51:39,149 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 199 transitions. Word has length 9 [2019-11-21 11:51:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:39,149 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 199 transitions. [2019-11-21 11:51:39,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 11:51:39,150 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 199 transitions. [2019-11-21 11:51:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 11:51:39,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:39,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:51:39,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:39,352 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 11:51:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1602886942, now seen corresponding path program 1 times [2019-11-21 11:51:39,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:39,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2025638267] [2019-11-21 11:51:39,354 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 11:51:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:39,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 11:51:39,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:39,545 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 11:51:39,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:39,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:39,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:51:39,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:51:39,565 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 11:51:39,566 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:39,612 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 11:51:39,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2025638267] [2019-11-21 11:51:39,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:39,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-21 11:51:39,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505696382] [2019-11-21 11:51:39,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:51:39,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:39,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:51:39,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:51:39,616 INFO L87 Difference]: Start difference. First operand 188 states and 199 transitions. Second operand 4 states. [2019-11-21 11:51:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:39,993 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2019-11-21 11:51:39,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 11:51:39,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 11:51:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:39,996 INFO L225 Difference]: With dead ends: 186 [2019-11-21 11:51:39,996 INFO L226 Difference]: Without dead ends: 186 [2019-11-21 11:51:39,997 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 11:51:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-21 11:51:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-21 11:51:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-21 11:51:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 197 transitions. [2019-11-21 11:51:40,009 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 197 transitions. Word has length 10 [2019-11-21 11:51:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:40,009 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 197 transitions. [2019-11-21 11:51:40,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:51:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 197 transitions. [2019-11-21 11:51:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 11:51:40,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:40,010 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:51:40,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:40,213 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 11:51:40,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1602886943, now seen corresponding path program 1 times [2019-11-21 11:51:40,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:40,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [666801866] [2019-11-21 11:51:40,215 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 11:51:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:40,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:51:40,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:40,406 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 11:51:40,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:40,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:40,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:51:40,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 11:51:40,427 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 11:51:40,427 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:40,458 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 11:51:40,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [666801866] [2019-11-21 11:51:40,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:40,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 11:51:40,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808835663] [2019-11-21 11:51:40,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:51:40,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:40,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:51:40,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:51:40,461 INFO L87 Difference]: Start difference. First operand 186 states and 197 transitions. Second operand 4 states. [2019-11-21 11:51:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:41,160 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2019-11-21 11:51:41,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 11:51:41,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 11:51:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:41,162 INFO L225 Difference]: With dead ends: 184 [2019-11-21 11:51:41,162 INFO L226 Difference]: Without dead ends: 184 [2019-11-21 11:51:41,163 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 11:51:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-21 11:51:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-11-21 11:51:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-21 11:51:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 195 transitions. [2019-11-21 11:51:41,172 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 195 transitions. Word has length 10 [2019-11-21 11:51:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:41,173 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 195 transitions. [2019-11-21 11:51:41,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:51:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 195 transitions. [2019-11-21 11:51:41,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-21 11:51:41,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:41,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:51:41,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:41,377 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 11:51:41,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:41,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2098788692, now seen corresponding path program 1 times [2019-11-21 11:51:41,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:41,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [440010733] [2019-11-21 11:51:41,380 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 11:51:41,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:41,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-21 11:51:41,579 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:41,586 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 11:51:41,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:41,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:41,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:51:41,597 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2019-11-21 11:51:41,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:41,671 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 11:51:41,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:41,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:41,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:51:41,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2019-11-21 11:51:41,715 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 11:51:41,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:41,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:41,759 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 11:51:41,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:41,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:41,786 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 11:51:41,786 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:18 [2019-11-21 11:51:41,810 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 11:51:41,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:41,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:41,823 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 11:51:41,824 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:41,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:41,829 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 11:51:41,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-11-21 11:51:41,849 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 11:51:41,849 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:41,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:51:44,461 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-21 11:51:44,502 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 11:51:44,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [440010733] [2019-11-21 11:51:44,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:44,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-11-21 11:51:44,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380064009] [2019-11-21 11:51:44,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 11:51:44,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:44,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 11:51:44,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=83, Unknown=1, NotChecked=0, Total=110 [2019-11-21 11:51:44,509 INFO L87 Difference]: Start difference. First operand 184 states and 195 transitions. Second operand 11 states. [2019-11-21 11:51:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:46,025 INFO L93 Difference]: Finished difference Result 192 states and 205 transitions. [2019-11-21 11:51:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 11:51:46,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 15 [2019-11-21 11:51:46,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:46,029 INFO L225 Difference]: With dead ends: 192 [2019-11-21 11:51:46,029 INFO L226 Difference]: Without dead ends: 192 [2019-11-21 11:51:46,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=41, Invalid=114, Unknown=1, NotChecked=0, Total=156 [2019-11-21 11:51:46,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-21 11:51:46,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2019-11-21 11:51:46,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-21 11:51:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 203 transitions. [2019-11-21 11:51:46,042 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 203 transitions. Word has length 15 [2019-11-21 11:51:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:46,042 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 203 transitions. [2019-11-21 11:51:46,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 11:51:46,043 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 203 transitions. [2019-11-21 11:51:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 11:51:46,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:46,044 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 11:51:46,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:46,250 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 11:51:46,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:46,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1692710809, now seen corresponding path program 1 times [2019-11-21 11:51:46,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:46,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [198115866] [2019-11-21 11:51:46,252 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 11:51:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:46,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 11:51:46,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:46,505 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 11:51:46,505 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:46,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:51:46,524 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 11:51:46,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [198115866] [2019-11-21 11:51:46,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:46,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:51:46,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948141747] [2019-11-21 11:51:46,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:51:46,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:46,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:51:46,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:51:46,526 INFO L87 Difference]: Start difference. First operand 191 states and 203 transitions. Second operand 4 states. [2019-11-21 11:51:46,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:46,572 INFO L93 Difference]: Finished difference Result 268 states and 284 transitions. [2019-11-21 11:51:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:51:46,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-21 11:51:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:46,575 INFO L225 Difference]: With dead ends: 268 [2019-11-21 11:51:46,575 INFO L226 Difference]: Without dead ends: 268 [2019-11-21 11:51:46,575 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 11:51:46,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-21 11:51:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 232. [2019-11-21 11:51:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-21 11:51:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 284 transitions. [2019-11-21 11:51:46,590 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 284 transitions. Word has length 17 [2019-11-21 11:51:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:46,590 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 284 transitions. [2019-11-21 11:51:46,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:51:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 284 transitions. [2019-11-21 11:51:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 11:51:46,591 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:46,592 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 11:51:46,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:46,803 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 11:51:46,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:46,804 INFO L82 PathProgramCache]: Analyzing trace with hash 934433737, now seen corresponding path program 1 times [2019-11-21 11:51:46,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:46,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1269202460] [2019-11-21 11:51:46,805 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 11:51:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:47,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:51:47,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:47,053 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 11:51:47,054 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 11:51:47,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:47,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:47,063 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 11:51:47,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-11-21 11:51:47,086 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 11:51:47,086 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:47,101 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 11:51:47,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1269202460] [2019-11-21 11:51:47,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:47,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 11:51:47,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438274833] [2019-11-21 11:51:47,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:51:47,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:47,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:51:47,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:51:47,106 INFO L87 Difference]: Start difference. First operand 232 states and 284 transitions. Second operand 4 states. [2019-11-21 11:51:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:47,817 INFO L93 Difference]: Finished difference Result 260 states and 314 transitions. [2019-11-21 11:51:47,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 11:51:47,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 11:51:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:47,820 INFO L225 Difference]: With dead ends: 260 [2019-11-21 11:51:47,821 INFO L226 Difference]: Without dead ends: 260 [2019-11-21 11:51:47,821 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 11:51:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-21 11:51:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 226. [2019-11-21 11:51:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-11-21 11:51:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 274 transitions. [2019-11-21 11:51:47,832 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 274 transitions. Word has length 18 [2019-11-21 11:51:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:47,832 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 274 transitions. [2019-11-21 11:51:47,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:51:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 274 transitions. [2019-11-21 11:51:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 11:51:47,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:47,834 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 11:51:48,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:48,038 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 11:51:48,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash 934433738, now seen corresponding path program 1 times [2019-11-21 11:51:48,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:48,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [176700814] [2019-11-21 11:51:48,039 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 11:51:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:48,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 11:51:48,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:48,289 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_112|], 1=[|v_#valid_160|]} [2019-11-21 11:51:48,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:51:48,294 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 11:51:48,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:48,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:48,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:51:48,316 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 11:51:48,316 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:48,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:48,326 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 11:51:48,326 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-11-21 11:51:48,337 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 11:51:48,338 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:48,373 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 11:51:48,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [176700814] [2019-11-21 11:51:48,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:48,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 11:51:48,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137595985] [2019-11-21 11:51:48,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 11:51:48,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:48,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 11:51:48,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 11:51:48,375 INFO L87 Difference]: Start difference. First operand 226 states and 274 transitions. Second operand 4 states. [2019-11-21 11:51:49,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:49,110 INFO L93 Difference]: Finished difference Result 251 states and 296 transitions. [2019-11-21 11:51:49,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 11:51:49,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-21 11:51:49,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:49,113 INFO L225 Difference]: With dead ends: 251 [2019-11-21 11:51:49,114 INFO L226 Difference]: Without dead ends: 251 [2019-11-21 11:51:49,115 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 11:51:49,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-21 11:51:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 217. [2019-11-21 11:51:49,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-21 11:51:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 256 transitions. [2019-11-21 11:51:49,122 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 256 transitions. Word has length 18 [2019-11-21 11:51:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:49,122 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 256 transitions. [2019-11-21 11:51:49,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 11:51:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 256 transitions. [2019-11-21 11:51:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 11:51:49,123 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:49,123 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 11:51:49,326 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:49,327 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 11:51:49,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:49,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1419279948, now seen corresponding path program 1 times [2019-11-21 11:51:49,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:49,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1064387512] [2019-11-21 11:51:49,329 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 11:51:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:49,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:51:49,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:49,559 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 11:51:49,559 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 11:51:49,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:49,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:49,568 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 11:51:49,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-11-21 11:51:49,590 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 11:51:49,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:49,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:49,602 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 11:51:49,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-21 11:51:49,617 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 11:51:49,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:49,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:49,620 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 11:51:49,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:7 [2019-11-21 11:51:49,627 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 11:51:49,627 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:49,652 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 11:51:49,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1064387512] [2019-11-21 11:51:49,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:49,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:51:49,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024855061] [2019-11-21 11:51:49,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:51:49,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:49,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:51:49,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:51:49,655 INFO L87 Difference]: Start difference. First operand 217 states and 256 transitions. Second operand 5 states. [2019-11-21 11:51:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:50,335 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2019-11-21 11:51:50,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:51:50,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 11:51:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:50,338 INFO L225 Difference]: With dead ends: 226 [2019-11-21 11:51:50,338 INFO L226 Difference]: Without dead ends: 226 [2019-11-21 11:51:50,338 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 11:51:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-11-21 11:51:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 216. [2019-11-21 11:51:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-21 11:51:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 254 transitions. [2019-11-21 11:51:50,345 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 254 transitions. Word has length 22 [2019-11-21 11:51:50,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:50,345 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 254 transitions. [2019-11-21 11:51:50,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:51:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 254 transitions. [2019-11-21 11:51:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 11:51:50,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:50,346 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 11:51:50,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:50,547 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 11:51:50,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:50,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1419279947, now seen corresponding path program 1 times [2019-11-21 11:51:50,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:50,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1675816631] [2019-11-21 11:51:50,548 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 11:51:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:50,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 11:51:50,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:50,813 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:50,814 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 11:51:50,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:50,841 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-21 11:51:50,842 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 11:51:50,842 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-21 11:51:50,861 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 11:51:50,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:50,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:50,881 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 11:51:50,881 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:50,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:50,893 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 11:51:50,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:23 [2019-11-21 11:51:50,945 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 23 treesize of output 11 [2019-11-21 11:51:50,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:50,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:50,971 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 11:51:50,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:50,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:50,980 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 11:51:50,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-21 11:51:50,999 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 11:51:51,000 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:51:51,308 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 11:51:51,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1675816631] [2019-11-21 11:51:51,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:51:51,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 11:51:51,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364030024] [2019-11-21 11:51:51,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:51:51,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:51:51,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:51:51,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:51:51,310 INFO L87 Difference]: Start difference. First operand 216 states and 254 transitions. Second operand 10 states. [2019-11-21 11:51:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:51:54,656 INFO L93 Difference]: Finished difference Result 318 states and 374 transitions. [2019-11-21 11:51:54,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 11:51:54,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 11:51:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:51:54,660 INFO L225 Difference]: With dead ends: 318 [2019-11-21 11:51:54,660 INFO L226 Difference]: Without dead ends: 318 [2019-11-21 11:51:54,660 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 11:51:54,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-11-21 11:51:54,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 232. [2019-11-21 11:51:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-21 11:51:54,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 272 transitions. [2019-11-21 11:51:54,669 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 272 transitions. Word has length 22 [2019-11-21 11:51:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:51:54,670 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 272 transitions. [2019-11-21 11:51:54,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:51:54,670 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 272 transitions. [2019-11-21 11:51:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 11:51:54,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:51:54,671 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 11:51:54,877 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:51:54,878 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 11:51:54,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:51:54,879 INFO L82 PathProgramCache]: Analyzing trace with hash 454608501, now seen corresponding path program 1 times [2019-11-21 11:51:54,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:51:54,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1149137311] [2019-11-21 11:51:54,880 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 11:51:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:51:55,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 11:51:55,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:51:55,297 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_117|], 1=[|v_#valid_174|]} [2019-11-21 11:51:55,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:51:55,302 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 11:51:55,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:55,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:55,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:51:55,318 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 11:51:55,318 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:55,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:55,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:51:55,328 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2019-11-21 11:51:55,358 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 11:51:55,358 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:55,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:55,384 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 11:51:55,384 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:55,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:55,400 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 11:51:55,400 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:28 [2019-11-21 11:51:55,550 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:55,550 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 97 treesize of output 109 [2019-11-21 11:51:55,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:51:55,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:51:55,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:51:55,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:51:55,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-21 11:51:55,677 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-11-21 11:51:55,678 INFO L567 ElimStorePlain]: treesize reduction 254, result has 22.3 percent of original size [2019-11-21 11:51:55,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:51:55,688 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 11:51:55,689 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:51:55,726 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:51:55,727 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 11:51:55,727 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:114, output treesize:63 [2019-11-21 11:52:01,796 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 11:52:03,879 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 11:52:05,946 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 11:52:05,951 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_71|], 12=[|v_#memory_$Pointer$.offset_70|]} [2019-11-21 11:52:05,995 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:52:05,996 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 129 treesize of output 131 [2019-11-21 11:52:05,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:52:05,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:05,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:06,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:06,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-11-21 11:52:06,232 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-11-21 11:52:06,233 INFO L567 ElimStorePlain]: treesize reduction 469, result has 23.0 percent of original size [2019-11-21 11:52:06,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:52:06,456 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-21 11:52:06,457 INFO L343 Elim1Store]: treesize reduction 18, result has 89.8 percent of original size [2019-11-21 11:52:06,457 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 11:52:06,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:06,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:52:20,683 WARN L192 SmtUtils]: Spent 14.22 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 11:52:20,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:52:20,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:52:20,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:20,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:20,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:20,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:20,695 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 11:52:20,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:148, output treesize:251 [2019-11-21 11:52:20,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:52:20,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:20,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:20,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:20,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:26,857 WARN L192 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 11:52:26,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:52:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:26,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:26,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:52:26,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:55:10,448 WARN L192 SmtUtils]: Spent 2.59 m on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2019-11-21 11:56:21,878 WARN L192 SmtUtils]: Spent 1.19 m on a formula simplification that was a NOOP. DAG size: 132 [2019-11-21 11:56:21,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 11:56:21,907 INFO L392 ElimStorePlain]: Different costs {110=[|#memory_$Pointer$.base|], 306=[|#memory_$Pointer$.offset|]} [2019-11-21 11:56:22,029 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-21 11:56:22,030 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 11:56:22,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:56:22,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:22,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:22,160 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:22,161 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 11:56:22,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:56:22,163 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:22,222 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:22,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:22,316 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 11:56:22,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:56:22,318 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:22,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:22,456 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:22,456 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 11:56:22,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:56:22,458 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:22,582 INFO L343 Elim1Store]: treesize reduction 18, result has 68.4 percent of original size [2019-11-21 11:56:22,583 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 149 treesize of output 124 [2019-11-21 11:56:22,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:56:22,584 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:23,201 WARN L192 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-21 11:56:23,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:23,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,358 INFO L237 Elim1Store]: Index analysis took 120 ms [2019-11-21 11:56:23,430 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:23,431 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 11:56:23,432 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:23,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,482 INFO L343 Elim1Store]: treesize reduction 52, result has 1.9 percent of original size [2019-11-21 11:56:23,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 30 [2019-11-21 11:56:23,483 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:23,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,624 INFO L237 Elim1Store]: Index analysis took 115 ms [2019-11-21 11:56:23,687 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:23,687 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 11:56:23,688 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:23,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,710 INFO L343 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2019-11-21 11:56:23,711 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 11:56:23,712 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:23,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:56:23,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:23,808 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 11:56:23,809 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-21 11:56:23,868 INFO L567 ElimStorePlain]: treesize reduction 88, result has 19.3 percent of original size [2019-11-21 11:56:23,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:56:23,869 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 12 variables, input treesize:807, output treesize:21 [2019-11-21 11:56:23,971 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 11:56:23,971 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:56:24,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:56:24,499 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 11:56:24,517 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 11:56:24,548 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 11:56:24,863 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-21 11:56:24,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:24,885 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 11:56:24,903 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 11:56:24,932 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 11:56:25,242 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-21 11:56:25,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:56:25,244 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 11:56:25,245 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:215, output treesize:250 [2019-11-21 11:56:32,876 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-21 11:56:39,995 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-11-21 11:56:50,969 WARN L192 SmtUtils]: Spent 803.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-21 11:56:50,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:56:51,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:56:51,188 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 11:56:51,194 INFO L168 Benchmark]: Toolchain (without parser) took 326696.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 957.7 MB in the beginning and 1.0 GB in the end (delta: -52.4 MB). Peak memory consumption was 248.6 MB. Max. memory is 11.5 GB. [2019-11-21 11:56:51,195 INFO L168 Benchmark]: CDTParser took 0.54 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 11:56:51,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-21 11:56:51,196 INFO L168 Benchmark]: Boogie Preprocessor took 151.66 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 11:56:51,196 INFO L168 Benchmark]: RCFGBuilder took 1404.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 991.8 MB in the end (delta: 86.1 MB). Peak memory consumption was 86.1 MB. Max. memory is 11.5 GB. [2019-11-21 11:56:51,197 INFO L168 Benchmark]: TraceAbstraction took 324429.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 991.8 MB in the beginning and 1.0 GB in the end (delta: -18.3 MB). Peak memory consumption was 166.8 MB. Max. memory is 11.5 GB. [2019-11-21 11:56:51,199 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.54 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 706.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 151.66 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 1404.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 991.8 MB in the end (delta: 86.1 MB). Peak memory consumption was 86.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 324429.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 991.8 MB in the beginning and 1.0 GB in the end (delta: -18.3 MB). Peak memory consumption was 166.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...