./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69e4d0785323ca2fbac076cafe34fff682fc43d2 --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 13:27:36,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 13:27:36,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 13:27:36,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 13:27:36,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 13:27:36,241 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 13:27:36,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 13:27:36,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 13:27:36,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 13:27:36,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 13:27:36,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 13:27:36,266 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 13:27:36,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 13:27:36,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 13:27:36,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 13:27:36,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 13:27:36,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 13:27:36,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 13:27:36,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 13:27:36,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 13:27:36,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 13:27:36,290 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 13:27:36,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 13:27:36,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 13:27:36,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 13:27:36,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 13:27:36,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 13:27:36,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 13:27:36,300 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 13:27:36,301 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 13:27:36,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 13:27:36,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 13:27:36,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 13:27:36,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 13:27:36,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 13:27:36,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 13:27:36,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 13:27:36,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 13:27:36,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 13:27:36,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 13:27:36,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 13:27:36,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 13:27:36,344 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 13:27:36,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 13:27:36,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 13:27:36,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 13:27:36,346 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 13:27:36,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 13:27:36,346 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 13:27:36,347 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 13:27:36,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 13:27:36,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 13:27:36,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 13:27:36,347 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 13:27:36,348 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 13:27:36,348 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 13:27:36,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 13:27:36,348 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 13:27:36,348 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 13:27:36,349 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 13:27:36,349 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 13:27:36,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 13:27:36,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 13:27:36,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 13:27:36,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 13:27:36,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 13:27:36,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 13:27:36,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 13:27:36,351 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 13:27:36,351 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 13:27:36,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 13:27:36,351 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69e4d0785323ca2fbac076cafe34fff682fc43d2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 13:27:36,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 13:27:36,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 13:27:36,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 13:27:36,678 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 13:27:36,679 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 13:27:36,680 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-11-21 13:27:36,756 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fd8b478/befc57a3ab70459b9fc2f3705219b4b0/FLAGdc279a90d [2019-11-21 13:27:37,310 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 13:27:37,311 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2019-11-21 13:27:37,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fd8b478/befc57a3ab70459b9fc2f3705219b4b0/FLAGdc279a90d [2019-11-21 13:27:37,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90fd8b478/befc57a3ab70459b9fc2f3705219b4b0 [2019-11-21 13:27:37,664 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 13:27:37,666 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 13:27:37,667 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 13:27:37,667 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 13:27:37,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 13:27:37,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:27:37" (1/1) ... [2019-11-21 13:27:37,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6628c258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:37, skipping insertion in model container [2019-11-21 13:27:37,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:27:37" (1/1) ... [2019-11-21 13:27:37,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 13:27:37,731 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:27:38,107 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:27:38,107 INFO L969 CHandler]: at location: C: (int *)malloc(sizeof(int)) [518] [2019-11-21 13:27:38,107 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:27:38,109 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 13:27:38,109 INFO L969 CHandler]: at location: C: (int *)malloc(sizeof(int)) [519] [2019-11-21 13:27:38,109 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:27:38,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:27:38,136 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 13:27:38,143 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:27:38,173 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:27:38,180 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 13:27:38,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:27:38,302 INFO L205 MainTranslator]: Completed translation [2019-11-21 13:27:38,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:38 WrapperNode [2019-11-21 13:27:38,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 13:27:38,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 13:27:38,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 13:27:38,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 13:27:38,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:38" (1/1) ... [2019-11-21 13:27:38,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:38" (1/1) ... [2019-11-21 13:27:38,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:38" (1/1) ... [2019-11-21 13:27:38,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:38" (1/1) ... [2019-11-21 13:27:38,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:38" (1/1) ... [2019-11-21 13:27:38,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:38" (1/1) ... [2019-11-21 13:27:38,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:38" (1/1) ... [2019-11-21 13:27:38,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 13:27:38,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 13:27:38,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 13:27:38,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 13:27:38,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 13:27:38,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 13:27:38,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 13:27:38,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 13:27:38,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 13:27:38,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 13:27:38,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 13:27:38,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 13:27:38,440 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-11-21 13:27:38,440 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-11-21 13:27:38,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 13:27:38,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 13:27:38,441 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 13:27:38,441 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 13:27:38,441 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 13:27:38,441 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 13:27:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 13:27:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 13:27:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 13:27:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 13:27:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 13:27:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 13:27:38,442 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 13:27:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 13:27:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 13:27:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 13:27:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 13:27:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 13:27:38,443 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 13:27:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 13:27:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 13:27:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 13:27:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 13:27:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 13:27:38,444 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 13:27:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 13:27:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 13:27:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 13:27:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 13:27:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 13:27:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 13:27:38,445 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 13:27:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 13:27:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 13:27:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 13:27:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 13:27:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 13:27:38,446 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 13:27:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 13:27:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 13:27:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 13:27:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 13:27:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 13:27:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 13:27:38,447 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 13:27:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 13:27:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 13:27:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 13:27:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 13:27:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 13:27:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 13:27:38,448 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 13:27:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 13:27:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 13:27:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 13:27:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 13:27:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 13:27:38,449 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 13:27:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 13:27:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 13:27:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 13:27:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 13:27:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 13:27:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 13:27:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 13:27:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 13:27:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 13:27:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 13:27:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 13:27:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 13:27:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 13:27:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 13:27:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 13:27:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 13:27:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 13:27:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 13:27:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 13:27:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 13:27:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 13:27:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 13:27:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 13:27:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 13:27:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 13:27:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 13:27:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 13:27:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 13:27:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 13:27:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 13:27:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 13:27:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 13:27:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 13:27:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 13:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 13:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 13:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 13:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 13:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 13:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 13:27:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 13:27:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 13:27:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 13:27:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 13:27:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 13:27:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 13:27:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 13:27:38,456 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 13:27:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 13:27:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 13:27:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 13:27:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-11-21 13:27:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 13:27:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 13:27:38,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 13:27:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 13:27:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-11-21 13:27:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 13:27:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 13:27:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 13:27:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 13:27:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 13:27:38,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 13:27:39,274 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 13:27:39,275 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-21 13:27:39,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:27:39 BoogieIcfgContainer [2019-11-21 13:27:39,276 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 13:27:39,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 13:27:39,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 13:27:39,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 13:27:39,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:27:37" (1/3) ... [2019-11-21 13:27:39,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148b6d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:27:39, skipping insertion in model container [2019-11-21 13:27:39,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:27:38" (2/3) ... [2019-11-21 13:27:39,285 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148b6d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:27:39, skipping insertion in model container [2019-11-21 13:27:39,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:27:39" (3/3) ... [2019-11-21 13:27:39,288 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019_1-2.i [2019-11-21 13:27:39,300 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 13:27:39,309 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 35 error locations. [2019-11-21 13:27:39,321 INFO L249 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2019-11-21 13:27:39,344 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 13:27:39,344 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 13:27:39,344 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 13:27:39,345 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 13:27:39,345 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 13:27:39,345 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 13:27:39,345 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 13:27:39,345 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 13:27:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states. [2019-11-21 13:27:39,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 13:27:39,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:27:39,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:27:39,388 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 13:27:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:27:39,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1034402705, now seen corresponding path program 1 times [2019-11-21 13:27:39,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:27:39,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [639490404] [2019-11-21 13:27:39,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:27:39,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 13:27:39,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:27:39,745 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:27:39,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:39,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:39,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:39,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:27:39,822 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:39,822 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 14 treesize of output 30 [2019-11-21 13:27:39,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:39,851 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 13:27:39,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:39,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-21 13:27:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:39,874 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:27:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:39,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639490404] [2019-11-21 13:27:39,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:27:39,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 13:27:39,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17547274] [2019-11-21 13:27:39,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:27:39,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:27:39,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:27:39,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:27:39,930 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 5 states. [2019-11-21 13:27:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:27:40,321 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-11-21 13:27:40,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:27:40,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-21 13:27:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:27:40,334 INFO L225 Difference]: With dead ends: 74 [2019-11-21 13:27:40,334 INFO L226 Difference]: Without dead ends: 71 [2019-11-21 13:27:40,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 13:27:40,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-21 13:27:40,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-21 13:27:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-21 13:27:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-11-21 13:27:40,380 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 9 [2019-11-21 13:27:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:27:40,380 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-11-21 13:27:40,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:27:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-11-21 13:27:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 13:27:40,381 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:27:40,381 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:27:40,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:40,594 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 13:27:40,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:27:40,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1034402704, now seen corresponding path program 1 times [2019-11-21 13:27:40,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:27:40,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1886746902] [2019-11-21 13:27:40,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:27:40,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 13:27:40,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:27:40,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:27:40,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:40,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:40,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:27:40,820 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:40,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:40,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:40,830 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 13:27:40,882 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:40,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 13:27:40,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:40,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:40,903 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 13:27:40,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:40,927 INFO L567 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-21 13:27:40,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:40,929 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-21 13:27:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:40,954 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:27:41,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:27:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:41,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1886746902] [2019-11-21 13:27:41,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:27:41,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 13:27:41,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403932928] [2019-11-21 13:27:41,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 13:27:41,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:27:41,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 13:27:41,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 13:27:41,283 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 8 states. [2019-11-21 13:27:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:27:42,202 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-11-21 13:27:42,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 13:27:42,204 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 13:27:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:27:42,206 INFO L225 Difference]: With dead ends: 67 [2019-11-21 13:27:42,206 INFO L226 Difference]: Without dead ends: 67 [2019-11-21 13:27:42,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-21 13:27:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-21 13:27:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-21 13:27:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-21 13:27:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-11-21 13:27:42,225 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2019-11-21 13:27:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:27:42,226 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-11-21 13:27:42,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 13:27:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-11-21 13:27:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-21 13:27:42,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:27:42,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:27:42,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:42,439 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 13:27:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:27:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1923554319, now seen corresponding path program 1 times [2019-11-21 13:27:42,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:27:42,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [137769861] [2019-11-21 13:27:42,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:27:42,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 13:27:42,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:27:42,636 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:27:42,636 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:42,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:42,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:27:42,648 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:42,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:42,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:42,658 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 13:27:42,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:27:42,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 13:27:42,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:42,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:42,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:27:42,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 13:27:42,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:42,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:42,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:42,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-21 13:27:42,837 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_76|], 3=[|v_#length_51|]} [2019-11-21 13:27:42,850 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:42,851 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 11 treesize of output 15 [2019-11-21 13:27:42,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:42,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:42,899 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:42,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-21 13:27:42,901 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:42,937 INFO L567 ElimStorePlain]: treesize reduction 28, result has 40.4 percent of original size [2019-11-21 13:27:42,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:42,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-11-21 13:27:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:42,952 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:27:42,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:27:43,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:27:43,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:43,148 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 31 treesize of output 35 [2019-11-21 13:27:43,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:43,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:43,173 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 28 treesize of output 32 [2019-11-21 13:27:43,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:43,215 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:43,216 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 26 treesize of output 30 [2019-11-21 13:27:43,217 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:43,266 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:43,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-11-21 13:27:43,268 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:53 [2019-11-21 13:27:43,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:27:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:43,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [137769861] [2019-11-21 13:27:43,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:27:43,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 10 [2019-11-21 13:27:43,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627181124] [2019-11-21 13:27:43,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 13:27:43,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:27:43,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 13:27:43,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-21 13:27:43,686 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 11 states. [2019-11-21 13:27:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:27:44,654 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-11-21 13:27:44,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:27:44,662 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-11-21 13:27:44,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:27:44,663 INFO L225 Difference]: With dead ends: 65 [2019-11-21 13:27:44,663 INFO L226 Difference]: Without dead ends: 65 [2019-11-21 13:27:44,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-21 13:27:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-21 13:27:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-21 13:27:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-21 13:27:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-11-21 13:27:44,670 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 11 [2019-11-21 13:27:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:27:44,671 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-11-21 13:27:44,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 13:27:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-11-21 13:27:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 13:27:44,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:27:44,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:27:44,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:44,879 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 13:27:44,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:27:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1699764301, now seen corresponding path program 1 times [2019-11-21 13:27:44,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:27:44,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [228338502] [2019-11-21 13:27:44,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 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:27:45,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 13:27:45,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:27:45,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:27:45,091 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:45,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:45,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:45,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 13:27:45,111 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 11 treesize of output 7 [2019-11-21 13:27:45,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:45,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:45,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:45,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-21 13:27:45,264 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-11-21 13:27:45,265 INFO L343 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2019-11-21 13:27:45,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 91 [2019-11-21 13:27:45,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:45,313 INFO L567 ElimStorePlain]: treesize reduction 40, result has 46.7 percent of original size [2019-11-21 13:27:45,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:45,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:35 [2019-11-21 13:27:45,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:27:45,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-11-21 13:27:45,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:45,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:45,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:45,379 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:53 [2019-11-21 13:27:45,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2019-11-21 13:27:45,436 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:45,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:45,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:45,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:26 [2019-11-21 13:27:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:45,484 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:27:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:45,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [228338502] [2019-11-21 13:27:45,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:27:45,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 12 [2019-11-21 13:27:45,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834817457] [2019-11-21 13:27:45,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 13:27:45,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:27:45,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 13:27:45,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-21 13:27:45,639 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 13 states. [2019-11-21 13:27:46,029 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-11-21 13:27:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:27:46,380 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-11-21 13:27:46,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 13:27:46,381 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-11-21 13:27:46,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:27:46,383 INFO L225 Difference]: With dead ends: 64 [2019-11-21 13:27:46,383 INFO L226 Difference]: Without dead ends: 64 [2019-11-21 13:27:46,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-21 13:27:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-21 13:27:46,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-21 13:27:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-21 13:27:46,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-11-21 13:27:46,399 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 13 [2019-11-21 13:27:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:27:46,400 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-11-21 13:27:46,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 13:27:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-11-21 13:27:46,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 13:27:46,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:27:46,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:27:46,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:46,605 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 13:27:46,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:27:46,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1699764300, now seen corresponding path program 1 times [2019-11-21 13:27:46,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:27:46,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1845201923] [2019-11-21 13:27:46,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:27:46,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 13:27:46,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:27:46,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:27:46,860 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:46,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:46,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 13:27:46,883 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:46,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:46,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:46,896 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-11-21 13:27:46,935 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 11 treesize of output 7 [2019-11-21 13:27:46,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:46,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:46,961 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 11 treesize of output 7 [2019-11-21 13:27:46,961 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:46,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:46,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:46,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-11-21 13:27:47,022 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:47,023 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 17 treesize of output 21 [2019-11-21 13:27:47,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:47,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:47,046 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 18 treesize of output 20 [2019-11-21 13:27:47,047 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:47,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:47,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:47,068 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:33 [2019-11-21 13:27:47,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:27:47,115 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 31 treesize of output 26 [2019-11-21 13:27:47,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:47,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:47,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:27:47,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 13:27:47,156 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:47,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:47,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:47,182 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:47 [2019-11-21 13:27:47,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2019-11-21 13:27:47,237 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:47,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:47,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 13:27:47,255 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:47,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:47,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:47,268 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:20 [2019-11-21 13:27:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:47,301 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:27:47,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:27:47,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:47,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1845201923] [2019-11-21 13:27:47,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:27:47,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 12 [2019-11-21 13:27:47,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378196290] [2019-11-21 13:27:47,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 13:27:47,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:27:47,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 13:27:47,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-21 13:27:47,779 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 13 states. [2019-11-21 13:27:48,289 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-11-21 13:27:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:27:48,898 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-11-21 13:27:48,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 13:27:48,899 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-11-21 13:27:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:27:48,900 INFO L225 Difference]: With dead ends: 63 [2019-11-21 13:27:48,901 INFO L226 Difference]: Without dead ends: 63 [2019-11-21 13:27:48,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-21 13:27:48,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-21 13:27:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-21 13:27:48,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-21 13:27:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-11-21 13:27:48,907 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 13 [2019-11-21 13:27:48,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:27:48,907 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-11-21 13:27:48,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 13:27:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-11-21 13:27:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 13:27:48,908 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:27:48,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:27:49,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:49,112 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr15ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr16ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5REQUIRES_VIOLATION, free_dataErr17ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9REQUIRES_VIOLATION, free_dataErr8REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr14ASSERT_VIOLATIONMEMORY_FREE, free_dataErr3REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 13:27:49,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:27:49,113 INFO L82 PathProgramCache]: Analyzing trace with hash -13867244, now seen corresponding path program 1 times [2019-11-21 13:27:49,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:27:49,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1459685595] [2019-11-21 13:27:49,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:27:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:27:49,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 13:27:49,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:27:49,484 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 11 treesize of output 7 [2019-11-21 13:27:49,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:49,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-21 13:27:49,533 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:49,534 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 12 treesize of output 28 [2019-11-21 13:27:49,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,563 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-21 13:27:49,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2019-11-21 13:27:49,600 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|], 2=[|v_#memory_$Pointer$.offset_33|]} [2019-11-21 13:27:49,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 13:27:49,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:49,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:27:49,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 13:27:49,644 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:49,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-11-21 13:27:49,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 13:27:49,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:49,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:30 [2019-11-21 13:27:49,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:27:49,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:27:49,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:27:49,798 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:49,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 85 [2019-11-21 13:27:49,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,837 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-11-21 13:27:49,837 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:60 [2019-11-21 13:27:49,895 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:49,895 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 55 treesize of output 26 [2019-11-21 13:27:49,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:27:49,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:27:49,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:49,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:11 [2019-11-21 13:27:49,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:27:49,930 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:27:49,962 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:50,053 INFO L567 ElimStorePlain]: treesize reduction 31, result has 68.7 percent of original size [2019-11-21 13:27:50,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:27:50,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:68 [2019-11-21 13:28:02,119 WARN L192 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 13:28:04,123 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_alloc_data_~pdata.base) c_alloc_data_~pdata.offset))) (let ((.cse3 (select |c_#memory_$Pointer$.base| .cse2)) (.cse4 (select (select |c_#memory_$Pointer$.offset| c_alloc_data_~pdata.base) c_alloc_data_~pdata.offset))) (let ((.cse5 (store .cse3 (bvadd .cse4 (_ bv3 32)) v_DerPreprocessor_1))) (let ((.cse0 (select .cse5 .cse4)) (.cse1 (store |c_#memory_$Pointer$.base| .cse2 .cse5))) (or (not (= v_DerPreprocessor_1 .cse0)) (not (= .cse1 (store |c_#memory_$Pointer$.base| .cse2 (store .cse3 (bvadd .cse4 (_ bv1 32)) .cse0)))) (= (_ bv1 1) (select |c_#valid| (select (select .cse1 c_alloc_data_~pdata.base) (bvadd c_alloc_data_~pdata.offset (_ bv4 32))))))))))) is different from false [2019-11-21 13:28:04,330 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:28:04,331 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 13:28:04,341 INFO L168 Benchmark]: Toolchain (without parser) took 26673.54 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.2 MB). Free memory was 956.3 MB in the beginning and 1.2 GB in the end (delta: -256.2 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-11-21 13:28:04,344 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:28:04,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 636.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-21 13:28:04,351 INFO L168 Benchmark]: Boogie Preprocessor took 73.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-21 13:28:04,352 INFO L168 Benchmark]: RCFGBuilder took 898.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-11-21 13:28:04,352 INFO L168 Benchmark]: TraceAbstraction took 25058.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:28:04,357 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 636.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 898.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25058.12 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.5 MB). There was no memory consumed. 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...