./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-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/array-memsafety-realloc/array-realloc-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 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 12:59:36,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:59:36,636 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:59:36,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:59:36,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:59:36,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:59:36,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:59:36,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:59:36,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:59:36,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:59:36,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:59:36,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:59:36,660 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:59:36,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:59:36,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:59:36,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:59:36,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:59:36,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:59:36,667 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:59:36,669 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:59:36,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:59:36,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:59:36,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:59:36,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:59:36,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:59:36,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:59:36,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:59:36,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:59:36,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:59:36,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:59:36,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:59:36,682 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:59:36,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:59:36,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:59:36,687 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:59:36,687 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:59:36,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:59:36,688 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:59:36,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:59:36,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:59:36,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:59:36,694 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 12:59:36,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:59:36,725 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:59:36,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:59:36,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:59:36,726 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:59:36,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:59:36,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 12:59:36,727 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:59:36,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:59:36,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 12:59:36,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:59:36,729 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:59:36,729 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:59:36,730 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 12:59:36,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:59:36,730 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:59:36,731 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:59:36,731 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 12:59:36,731 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:59:36,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:59:36,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:59:36,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:59:36,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:59:36,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:59:36,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:59:36,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:59:36,733 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:59:36,733 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:59:36,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:59:36,734 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 -> 5ce6ab98ff3a344cbd8c93195b0f965c65d244bc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 12:59:37,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:59:37,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:59:37,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:59:37,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:59:37,122 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:59:37,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2019-11-21 12:59:37,183 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec10ad13f/60a8bd68f01b4f6fa2f7b998306eee36/FLAGb45e0cd87 [2019-11-21 12:59:37,647 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:59:37,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2019-11-21 12:59:37,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec10ad13f/60a8bd68f01b4f6fa2f7b998306eee36/FLAGb45e0cd87 [2019-11-21 12:59:38,004 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec10ad13f/60a8bd68f01b4f6fa2f7b998306eee36 [2019-11-21 12:59:38,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:59:38,009 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:59:38,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:59:38,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:59:38,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:59:38,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:59:38" (1/1) ... [2019-11-21 12:59:38,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60856bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59:38, skipping insertion in model container [2019-11-21 12:59:38,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:59:38" (1/1) ... [2019-11-21 12:59:38,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:59:38,081 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:59:38,558 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 12:59:38,558 INFO L969 CHandler]: at location: C: (int *)malloc(sizeof(int)) [575] [2019-11-21 12:59:38,558 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:59:38,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:59:38,579 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:59:38,585 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:59:38,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:59:38,620 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:59:38,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:59:38,715 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:59:38,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59:38 WrapperNode [2019-11-21 12:59:38,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:59:38,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:59:38,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:59:38,717 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:59:38,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59:38" (1/1) ... [2019-11-21 12:59:38,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59:38" (1/1) ... [2019-11-21 12:59:38,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59:38" (1/1) ... [2019-11-21 12:59:38,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59:38" (1/1) ... [2019-11-21 12:59:38,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59:38" (1/1) ... [2019-11-21 12:59:38,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59:38" (1/1) ... [2019-11-21 12:59:38,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59:38" (1/1) ... [2019-11-21 12:59:38,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:59:38,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:59:38,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:59:38,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:59:38,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59: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 12:59:38,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:59:38,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:59:38,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 12:59:38,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 12:59:38,860 INFO L138 BoogieDeclarations]: Found implementation of procedure expandArray [2019-11-21 12:59:38,860 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:59:38,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2019-11-21 12:59:38,860 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 12:59:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 12:59:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 12:59:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 12:59:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 12:59:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 12:59:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 12:59:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 12:59:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 12:59:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 12:59:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 12:59:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 12:59:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 12:59:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 12:59:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 12:59:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 12:59:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 12:59:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 12:59:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 12:59:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 12:59:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 12:59:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 12:59:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 12:59:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 12:59:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 12:59:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 12:59:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 12:59:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 12:59:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 12:59:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 12:59:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 12:59:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 12:59:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 12:59:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 12:59:38,865 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 12:59:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 12:59:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 12:59:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 12:59:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 12:59:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 12:59:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 12:59:38,866 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 12:59:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 12:59:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 12:59:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 12:59:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 12:59:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 12:59:38,867 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 12:59:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 12:59:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 12:59:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 12:59:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 12:59:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:59:38,868 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 12:59:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 12:59:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:59:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 12:59:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 12:59:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 12:59:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 12:59:38,869 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 12:59:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 12:59:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 12:59:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 12:59:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 12:59:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 12:59:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 12:59:38,870 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 12:59:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 12:59:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 12:59:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 12:59:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 12:59:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 12:59:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 12:59:38,871 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 12:59:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 12:59:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 12:59:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 12:59:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 12:59:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 12:59:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 12:59:38,872 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 12:59:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 12:59:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 12:59:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 12:59:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 12:59:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 12:59:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 12:59:38,873 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 12:59:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 12:59:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 12:59:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 12:59:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 12:59:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 12:59:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 12:59:38,874 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 12:59:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 12:59:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 12:59:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 12:59:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 12:59:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 12:59:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 12:59:38,875 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 12:59:38,876 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 12:59:38,876 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 12:59:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 12:59:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure expandArray [2019-11-21 12:59:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2019-11-21 12:59:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:59:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 12:59:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:59:38,877 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:59:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:59:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 12:59:38,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 12:59:38,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:59:38,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:59:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:59:38,883 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 12:59:39,557 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:59:39,557 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-21 12:59:39,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:59:39 BoogieIcfgContainer [2019-11-21 12:59:39,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:59:39,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:59:39,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:59:39,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:59:39,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:59:38" (1/3) ... [2019-11-21 12:59:39,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab53c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:59:39, skipping insertion in model container [2019-11-21 12:59:39,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:59:38" (2/3) ... [2019-11-21 12:59:39,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ab53c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:59:39, skipping insertion in model container [2019-11-21 12:59:39,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:59:39" (3/3) ... [2019-11-21 12:59:39,576 INFO L109 eAbstractionObserver]: Analyzing ICFG array-realloc-2.i [2019-11-21 12:59:39,588 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:59:39,595 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2019-11-21 12:59:39,606 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2019-11-21 12:59:39,627 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:59:39,627 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:59:39,627 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:59:39,628 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:59:39,628 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:59:39,628 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:59:39,628 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:59:39,628 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:59:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-21 12:59:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 12:59:39,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:39,655 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:39,655 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash 529620371, now seen corresponding path program 1 times [2019-11-21 12:59:39,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:39,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [255119096] [2019-11-21 12:59:39,674 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 12:59:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:39,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-21 12:59:39,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:39,937 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 12:59:39,937 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:39,951 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 12:59:39,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [255119096] [2019-11-21 12:59:39,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:39,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:59:39,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462446856] [2019-11-21 12:59:39,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 12:59:39,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:39,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 12:59:39,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:59:39,973 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2019-11-21 12:59:40,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:40,133 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2019-11-21 12:59:40,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:59:40,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-21 12:59:40,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:40,148 INFO L225 Difference]: With dead ends: 56 [2019-11-21 12:59:40,148 INFO L226 Difference]: Without dead ends: 52 [2019-11-21 12:59:40,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:59:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-11-21 12:59:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2019-11-21 12:59:40,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-21 12:59:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-21 12:59:40,200 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 8 [2019-11-21 12:59:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:40,201 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-21 12:59:40,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 12:59:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-21 12:59:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 12:59:40,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:40,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:40,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:40,415 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:40,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:40,416 INFO L82 PathProgramCache]: Analyzing trace with hash 529620385, now seen corresponding path program 1 times [2019-11-21 12:59:40,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:40,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1941247847] [2019-11-21 12:59:40,418 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 12:59:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:40,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:59:40,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:40,775 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 1=[|v_#valid_40|]} [2019-11-21 12:59:40,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:59:40,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-11-21 12:59:40,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:40,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:40,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2019-11-21 12:59:40,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:40,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:40,870 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 18 treesize of output 10 [2019-11-21 12:59:40,871 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:59:40,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:40,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:59:40,886 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2019-11-21 12:59:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:59:40,906 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:40,950 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 12:59:40,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1941247847] [2019-11-21 12:59:40,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:40,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-21 12:59:40,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080428277] [2019-11-21 12:59:40,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:59:40,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:40,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:59:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:59:40,954 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 4 states. [2019-11-21 12:59:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:41,141 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-11-21 12:59:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 12:59:41,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-21 12:59:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:41,143 INFO L225 Difference]: With dead ends: 43 [2019-11-21 12:59:41,143 INFO L226 Difference]: Without dead ends: 43 [2019-11-21 12:59:41,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:59:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-21 12:59:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-21 12:59:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-21 12:59:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-11-21 12:59:41,155 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 8 [2019-11-21 12:59:41,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:41,155 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-11-21 12:59:41,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:59:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-11-21 12:59:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-21 12:59:41,159 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:41,159 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:41,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:41,372 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash 529620384, now seen corresponding path program 1 times [2019-11-21 12:59:41,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:41,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [387243486] [2019-11-21 12:59:41,373 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 12:59:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:41,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 12:59:41,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:41,612 INFO L343 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2019-11-21 12:59:41,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 15 [2019-11-21 12:59:41,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:41,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:41,636 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 9 treesize of output 5 [2019-11-21 12:59:41,637 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:59:41,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:41,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:59:41,650 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:13, output treesize:11 [2019-11-21 12:59:41,668 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 12:59:41,668 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:41,683 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 12:59:41,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [387243486] [2019-11-21 12:59:41,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:41,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:59:41,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703601775] [2019-11-21 12:59:41,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 12:59:41,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:41,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 12:59:41,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:59:41,685 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 3 states. [2019-11-21 12:59:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:41,783 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-21 12:59:41,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:59:41,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-21 12:59:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:41,785 INFO L225 Difference]: With dead ends: 42 [2019-11-21 12:59:41,786 INFO L226 Difference]: Without dead ends: 42 [2019-11-21 12:59:41,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:59:41,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-21 12:59:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-21 12:59:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-21 12:59:41,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-21 12:59:41,793 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 8 [2019-11-21 12:59:41,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:41,793 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-21 12:59:41,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 12:59:41,793 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-21 12:59:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-21 12:59:41,794 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:41,794 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:42,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:42,011 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:42,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2135919539, now seen corresponding path program 1 times [2019-11-21 12:59:42,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:42,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1336788140] [2019-11-21 12:59:42,013 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 12:59:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:42,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 12:59:42,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:42,217 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 16 treesize of output 8 [2019-11-21 12:59:42,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:42,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:42,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:59:42,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-21 12:59:42,226 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 12:59:42,227 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:42,237 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 12:59:42,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1336788140] [2019-11-21 12:59:42,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:42,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:59:42,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209618837] [2019-11-21 12:59:42,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-21 12:59:42,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-21 12:59:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-21 12:59:42,239 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-11-21 12:59:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:42,322 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-21 12:59:42,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-21 12:59:42,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-21 12:59:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:42,324 INFO L225 Difference]: With dead ends: 42 [2019-11-21 12:59:42,324 INFO L226 Difference]: Without dead ends: 42 [2019-11-21 12:59:42,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:59:42,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-21 12:59:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-21 12:59:42,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-21 12:59:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-11-21 12:59:42,330 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 10 [2019-11-21 12:59:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:42,331 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-11-21 12:59:42,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-21 12:59:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-11-21 12:59:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 12:59:42,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:42,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:42,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:42,533 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:42,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436269, now seen corresponding path program 1 times [2019-11-21 12:59:42,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:42,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [464461701] [2019-11-21 12:59:42,535 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 12:59:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:42,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:59:42,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:42,812 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 12:59:42,813 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:42,831 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 12:59:42,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [464461701] [2019-11-21 12:59:42,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:42,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:59:42,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794217431] [2019-11-21 12:59:42,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:59:42,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:42,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:59:42,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:59:42,835 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 5 states. [2019-11-21 12:59:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:43,075 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-11-21 12:59:43,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:59:43,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-21 12:59:43,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:43,077 INFO L225 Difference]: With dead ends: 53 [2019-11-21 12:59:43,077 INFO L226 Difference]: Without dead ends: 53 [2019-11-21 12:59:43,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 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 12:59:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-21 12:59:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-11-21 12:59:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-21 12:59:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-11-21 12:59:43,085 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 13 [2019-11-21 12:59:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:43,085 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-11-21 12:59:43,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:59:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-11-21 12:59:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 12:59:43,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:43,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:43,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:43,291 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:43,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1236436268, now seen corresponding path program 1 times [2019-11-21 12:59:43,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:43,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1419348769] [2019-11-21 12:59:43,293 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 12:59:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:43,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 12:59:43,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:43,620 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 12:59:43,620 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:43,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:59:43,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-21 12:59:43,792 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 12:59:43,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-21 12:59:43,808 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:59:43,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:43,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-21 12:59:43,834 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 12:59:43,916 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 12:59:43,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1419348769] [2019-11-21 12:59:43,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:43,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 12:59:43,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568405070] [2019-11-21 12:59:43,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:59:43,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:43,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:59:43,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:59:43,919 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 10 states. [2019-11-21 12:59:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:44,318 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-11-21 12:59:44,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 12:59:44,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-11-21 12:59:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:44,320 INFO L225 Difference]: With dead ends: 50 [2019-11-21 12:59:44,320 INFO L226 Difference]: Without dead ends: 50 [2019-11-21 12:59:44,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-21 12:59:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-21 12:59:44,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-11-21 12:59:44,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-21 12:59:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2019-11-21 12:59:44,327 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2019-11-21 12:59:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:44,327 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2019-11-21 12:59:44,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:59:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2019-11-21 12:59:44,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-21 12:59:44,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:44,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:44,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:44,537 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:44,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2119265845, now seen corresponding path program 1 times [2019-11-21 12:59:44,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:44,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [395396607] [2019-11-21 12:59:44,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:44,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:59:44,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:44,901 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 12:59:44,902 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:59:45,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [395396607] [2019-11-21 12:59:45,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:45,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-21 12:59:45,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941034874] [2019-11-21 12:59:45,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:59:45,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:45,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:59:45,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:59:45,002 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 10 states. [2019-11-21 12:59:45,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:45,150 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-11-21 12:59:45,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 12:59:45,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-11-21 12:59:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:45,154 INFO L225 Difference]: With dead ends: 41 [2019-11-21 12:59:45,154 INFO L226 Difference]: Without dead ends: 41 [2019-11-21 12:59:45,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-11-21 12:59:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-21 12:59:45,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-21 12:59:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-21 12:59:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-11-21 12:59:45,159 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 18 [2019-11-21 12:59:45,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:45,159 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-11-21 12:59:45,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:59:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-11-21 12:59:45,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:59:45,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:45,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:45,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:45,363 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:45,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:45,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2000066657, now seen corresponding path program 1 times [2019-11-21 12:59:45,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:45,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [921139459] [2019-11-21 12:59:45,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:45,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 12:59:45,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:45,660 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 16 treesize of output 8 [2019-11-21 12:59:45,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:45,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:45,663 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 12:59:45,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-21 12:59:45,681 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 12:59:45,682 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:45,780 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 12:59:45,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [921139459] [2019-11-21 12:59:45,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:45,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-21 12:59:45,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348310538] [2019-11-21 12:59:45,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:59:45,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:45,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:59:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:59:45,782 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2019-11-21 12:59:46,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:46,018 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-11-21 12:59:46,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 12:59:46,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-21 12:59:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:46,020 INFO L225 Difference]: With dead ends: 46 [2019-11-21 12:59:46,020 INFO L226 Difference]: Without dead ends: 46 [2019-11-21 12:59:46,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:59:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-21 12:59:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-11-21 12:59:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-21 12:59:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-11-21 12:59:46,026 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 20 [2019-11-21 12:59:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:46,026 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-11-21 12:59:46,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:59:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-11-21 12:59:46,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:59:46,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:46,028 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:46,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:46,229 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:46,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:46,230 INFO L82 PathProgramCache]: Analyzing trace with hash 2028695808, now seen corresponding path program 1 times [2019-11-21 12:59:46,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:46,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1390383654] [2019-11-21 12:59:46,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:46,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:59:46,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:46,501 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:46,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 12:59:46,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:46,526 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-21 12:59:46,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:59:46,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:5 [2019-11-21 12:59:46,545 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 12:59:46,546 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:46,570 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 12:59:46,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1390383654] [2019-11-21 12:59:46,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:46,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:59:46,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795495821] [2019-11-21 12:59:46,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:59:46,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:46,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:59:46,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:59:46,573 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2019-11-21 12:59:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:46,735 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2019-11-21 12:59:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:59:46,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-21 12:59:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:46,737 INFO L225 Difference]: With dead ends: 44 [2019-11-21 12:59:46,738 INFO L226 Difference]: Without dead ends: 44 [2019-11-21 12:59:46,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:59:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-21 12:59:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-21 12:59:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-21 12:59:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2019-11-21 12:59:46,743 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 20 [2019-11-21 12:59:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:46,744 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2019-11-21 12:59:46,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:59:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2019-11-21 12:59:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:59:46,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:46,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:46,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:46,946 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:46,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2028695809, now seen corresponding path program 1 times [2019-11-21 12:59:46,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:46,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [874598817] [2019-11-21 12:59:46,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:47,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 12:59:47,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:47,243 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 12:59:47,243 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:47,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:47,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:59:47,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-21 12:59:47,305 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 12:59:47,305 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:47,765 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 12:59:47,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [874598817] [2019-11-21 12:59:47,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:47,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-21 12:59:47,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460890996] [2019-11-21 12:59:47,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 12:59:47,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:47,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 12:59:47,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:59:47,767 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 12 states. [2019-11-21 12:59:48,469 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-21 12:59:49,131 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-11-21 12:59:49,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:49,604 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2019-11-21 12:59:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 12:59:49,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-21 12:59:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:49,607 INFO L225 Difference]: With dead ends: 131 [2019-11-21 12:59:49,607 INFO L226 Difference]: Without dead ends: 129 [2019-11-21 12:59:49,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-11-21 12:59:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-21 12:59:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 68. [2019-11-21 12:59:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-21 12:59:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2019-11-21 12:59:49,616 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 20 [2019-11-21 12:59:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:49,617 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2019-11-21 12:59:49,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 12:59:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2019-11-21 12:59:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:59:49,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:49,618 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:49,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:49,823 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:49,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:49,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939367, now seen corresponding path program 1 times [2019-11-21 12:59:49,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:49,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1518146612] [2019-11-21 12:59:49,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:50,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 12:59:50,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:50,214 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2019-11-21 12:59:50,215 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:50,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:50,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:59:50,220 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-21 12:59:50,288 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 16 treesize of output 8 [2019-11-21 12:59:50,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:50,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:50,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:59:50,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-21 12:59:50,410 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:50,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2019-11-21 12:59:50,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:50,450 INFO L567 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2019-11-21 12:59:50,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:59:50,452 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 12:59:50,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:24 [2019-11-21 12:59:50,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:59:50,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:59:50,544 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 12:59:50,545 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:50,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:59:50,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-21 12:59:50,747 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:50,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-11-21 12:59:50,751 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:50,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:50,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:59:50,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:8 [2019-11-21 12:59:50,779 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 12:59:50,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1518146612] [2019-11-21 12:59:50,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:50,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 15 [2019-11-21 12:59:50,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284163236] [2019-11-21 12:59:50,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 12:59:50,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:50,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 12:59:50,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:59:50,782 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand 16 states. [2019-11-21 12:59:51,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:59:51,441 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-11-21 12:59:51,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:59:51,442 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-11-21 12:59:51,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:59:51,443 INFO L225 Difference]: With dead ends: 77 [2019-11-21 12:59:51,444 INFO L226 Difference]: Without dead ends: 77 [2019-11-21 12:59:51,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2019-11-21 12:59:51,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-21 12:59:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2019-11-21 12:59:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-21 12:59:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-11-21 12:59:51,451 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 21 [2019-11-21 12:59:51,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:59:51,452 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-11-21 12:59:51,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 12:59:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-11-21 12:59:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:59:51,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:59:51,453 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:59:51,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:51,657 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 12:59:51,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:59:51,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939366, now seen corresponding path program 1 times [2019-11-21 12:59:51,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:59:51,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1829092713] [2019-11-21 12:59:51,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:59:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:59:52,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-21 12:59:52,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:59:52,076 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 1=[|v_#valid_109|]} [2019-11-21 12:59:52,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:59:52,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2019-11-21 12:59:52,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:52,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:52,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2019-11-21 12:59:52,103 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:52,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:52,128 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 18 treesize of output 10 [2019-11-21 12:59:52,129 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:59:52,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:52,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:59:52,145 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2019-11-21 12:59:52,406 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:59:52,407 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 52 [2019-11-21 12:59:52,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:59:52,477 INFO L567 ElimStorePlain]: treesize reduction 28, result has 45.1 percent of original size [2019-11-21 12:59:52,478 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 12:59:52,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-11-21 12:59:52,599 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 12:59:52,599 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:59:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:59:54,952 WARN L192 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-21 12:59:56,273 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 12:59:56,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1829092713] [2019-11-21 12:59:56,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:59:56,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 18 [2019-11-21 12:59:56,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870618999] [2019-11-21 12:59:56,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-21 12:59:56,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:59:56,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-21 12:59:56,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-11-21 12:59:56,275 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 19 states. [2019-11-21 12:59:59,437 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-21 13:00:10,308 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-11-21 13:00:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:00:35,414 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2019-11-21 13:00:35,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-21 13:00:35,415 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2019-11-21 13:00:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:00:35,416 INFO L225 Difference]: With dead ends: 99 [2019-11-21 13:00:35,416 INFO L226 Difference]: Without dead ends: 99 [2019-11-21 13:00:35,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-11-21 13:00:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-21 13:00:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 83. [2019-11-21 13:00:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-21 13:00:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2019-11-21 13:00:35,425 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 21 [2019-11-21 13:00:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:00:35,426 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2019-11-21 13:00:35,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-21 13:00:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2019-11-21 13:00:35,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 13:00:35,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:00:35,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:00:35,633 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:35,634 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 13:00:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:00:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1895188378, now seen corresponding path program 1 times [2019-11-21 13:00:35,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:00:35,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [904012200] [2019-11-21 13:00:35,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:00:35,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 13:00:35,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:00:35,859 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:00:35,860 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:00:35,919 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:00:35,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [904012200] [2019-11-21 13:00:35,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:00:35,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 13:00:35,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688697767] [2019-11-21 13:00:35,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:00:35,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:00:35,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:00:35,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:00:35,921 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand 5 states. [2019-11-21 13:00:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:00:35,995 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2019-11-21 13:00:35,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 13:00:35,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-21 13:00:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:00:35,999 INFO L225 Difference]: With dead ends: 83 [2019-11-21 13:00:35,999 INFO L226 Difference]: Without dead ends: 83 [2019-11-21 13:00:35,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 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:00:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-21 13:00:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-21 13:00:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-21 13:00:36,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 95 transitions. [2019-11-21 13:00:36,007 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 95 transitions. Word has length 23 [2019-11-21 13:00:36,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:00:36,007 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 95 transitions. [2019-11-21 13:00:36,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:00:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 95 transitions. [2019-11-21 13:00:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-21 13:00:36,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:00:36,009 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:00:36,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:36,212 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 13:00:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:00:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1554357335, now seen corresponding path program 1 times [2019-11-21 13:00:36,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:00:36,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1635113587] [2019-11-21 13:00:36,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:00:36,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:00:36,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:00:36,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 13:00:36,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:36,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:36,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:36,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:5, output treesize:1 [2019-11-21 13:00:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:36,538 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:00:36,590 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-21 13:00:36,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:36,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:36,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:36,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:1 [2019-11-21 13:00:36,619 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:36,620 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 14 treesize of output 18 [2019-11-21 13:00:36,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:36,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:36,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:36,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:36,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2019-11-21 13:00:36,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:36,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1635113587] [2019-11-21 13:00:36,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:00:36,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-21 13:00:36,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627183851] [2019-11-21 13:00:36,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:00:36,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:00:36,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:00:36,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:00:36,634 INFO L87 Difference]: Start difference. First operand 83 states and 95 transitions. Second operand 5 states. [2019-11-21 13:00:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:00:36,775 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2019-11-21 13:00:36,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 13:00:36,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-21 13:00:36,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:00:36,778 INFO L225 Difference]: With dead ends: 82 [2019-11-21 13:00:36,778 INFO L226 Difference]: Without dead ends: 82 [2019-11-21 13:00:36,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 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:00:36,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-21 13:00:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-21 13:00:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-21 13:00:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2019-11-21 13:00:36,784 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 27 [2019-11-21 13:00:36,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:00:36,785 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2019-11-21 13:00:36,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:00:36,785 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2019-11-21 13:00:36,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-21 13:00:36,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:00:36,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:00:36,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:36,990 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 13:00:36,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:00:36,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1554357336, now seen corresponding path program 1 times [2019-11-21 13:00:36,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:00:36,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [764097582] [2019-11-21 13:00:36,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:00:37,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 13:00:37,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:00:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:37,364 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:00:37,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:00:37,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-21 13:00:37,482 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:00:37,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2019-11-21 13:00:37,492 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 13:00:37,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:37,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-21 13:00:37,524 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2019-11-21 13:00:37,688 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:37,689 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 16 treesize of output 20 [2019-11-21 13:00:37,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:37,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:37,692 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 13:00:37,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:37,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:37,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 13:00:37,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-11-21 13:00:37,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:37,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:37,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:38,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:38,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:38,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:38,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:38,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [764097582] [2019-11-21 13:00:38,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:00:38,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-11-21 13:00:38,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658579719] [2019-11-21 13:00:38,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 13:00:38,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:00:38,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 13:00:38,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-21 13:00:38,588 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand 10 states. [2019-11-21 13:00:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:00:38,899 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-11-21 13:00:38,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 13:00:38,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-21 13:00:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:00:38,902 INFO L225 Difference]: With dead ends: 81 [2019-11-21 13:00:38,903 INFO L226 Difference]: Without dead ends: 81 [2019-11-21 13:00:38,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-21 13:00:38,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-21 13:00:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-11-21 13:00:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-21 13:00:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-11-21 13:00:38,913 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 27 [2019-11-21 13:00:38,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:00:38,913 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-11-21 13:00:38,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 13:00:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-11-21 13:00:38,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 13:00:38,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:00:38,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:00:39,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:39,117 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 13:00:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:00:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash 940437124, now seen corresponding path program 1 times [2019-11-21 13:00:39,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:00:39,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [615682511] [2019-11-21 13:00:39,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:00:39,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 13:00:39,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:00:39,513 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:00:39,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:39,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:39,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:39,517 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-21 13:00:39,556 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:00:39,556 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:39,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:39,559 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:00:39,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-21 13:00:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:39,572 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:00:39,691 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 28 treesize of output 24 [2019-11-21 13:00:39,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-21 13:00:39,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:39,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-21 13:00:39,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2019-11-21 13:00:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:39,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [615682511] [2019-11-21 13:00:39,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:00:39,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2019-11-21 13:00:39,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041001802] [2019-11-21 13:00:39,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 13:00:39,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:00:39,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 13:00:39,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-21 13:00:39,724 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 11 states. [2019-11-21 13:00:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:00:40,104 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2019-11-21 13:00:40,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 13:00:40,106 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-11-21 13:00:40,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:00:40,107 INFO L225 Difference]: With dead ends: 80 [2019-11-21 13:00:40,107 INFO L226 Difference]: Without dead ends: 80 [2019-11-21 13:00:40,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-21 13:00:40,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-21 13:00:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-21 13:00:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-21 13:00:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 92 transitions. [2019-11-21 13:00:40,113 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 92 transitions. Word has length 28 [2019-11-21 13:00:40,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:00:40,113 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 92 transitions. [2019-11-21 13:00:40,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 13:00:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 92 transitions. [2019-11-21 13:00:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 13:00:40,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:00:40,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:00:40,318 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:40,319 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 13:00:40,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:00:40,319 INFO L82 PathProgramCache]: Analyzing trace with hash -911220169, now seen corresponding path program 1 times [2019-11-21 13:00:40,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:00:40,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [637381366] [2019-11-21 13:00:40,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:00:40,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 13:00:40,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:00:40,784 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:00:40,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:40,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:40,796 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:00:40,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2019-11-21 13:00:40,858 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:00:40,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:40,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:40,881 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:00:40,881 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-21 13:00:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:40,913 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:00:41,109 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 28 treesize of output 24 [2019-11-21 13:00:41,110 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:00:41,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:41,152 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:00:41,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:24 [2019-11-21 13:00:41,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:00:41,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:41,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:41,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:41,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:00:41,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:41,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [637381366] [2019-11-21 13:00:41,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:00:41,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2019-11-21 13:00:41,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37812003] [2019-11-21 13:00:41,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 13:00:41,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:00:41,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 13:00:41,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-21 13:00:41,571 INFO L87 Difference]: Start difference. First operand 80 states and 92 transitions. Second operand 18 states. [2019-11-21 13:00:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:00:42,352 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-11-21 13:00:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 13:00:42,355 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2019-11-21 13:00:42,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:00:42,356 INFO L225 Difference]: With dead ends: 79 [2019-11-21 13:00:42,356 INFO L226 Difference]: Without dead ends: 79 [2019-11-21 13:00:42,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-11-21 13:00:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-21 13:00:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-11-21 13:00:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-21 13:00:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2019-11-21 13:00:42,366 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 29 [2019-11-21 13:00:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:00:42,367 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2019-11-21 13:00:42,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 13:00:42,367 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2019-11-21 13:00:42,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-21 13:00:42,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:00:42,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:00:42,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:42,578 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 13:00:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:00:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1816945894, now seen corresponding path program 1 times [2019-11-21 13:00:42,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:00:42,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1243710049] [2019-11-21 13:00:42,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:00:42,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-21 13:00:42,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:00:42,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 13:00:42,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:42,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:42,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:42,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 13:00:42,900 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:42,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 13:00:42,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:42,921 INFO L567 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-11-21 13:00:42,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:42,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:5 [2019-11-21 13:00:42,978 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:00:42,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:42,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:42,986 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:00:42,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-21 13:00:43,023 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 17 treesize of output 9 [2019-11-21 13:00:43,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:43,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:43,026 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:00:43,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-11-21 13:00:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:43,039 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:00:43,208 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 36 treesize of output 32 [2019-11-21 13:00:43,209 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:00:43,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:43,240 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:00:43,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-11-21 13:00:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:43,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1243710049] [2019-11-21 13:00:43,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:00:43,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-11-21 13:00:43,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137883176] [2019-11-21 13:00:43,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 13:00:43,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:00:43,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 13:00:43,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-11-21 13:00:43,504 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand 13 states. [2019-11-21 13:00:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:00:43,998 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2019-11-21 13:00:43,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 13:00:43,999 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-11-21 13:00:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:00:44,001 INFO L225 Difference]: With dead ends: 78 [2019-11-21 13:00:44,001 INFO L226 Difference]: Without dead ends: 78 [2019-11-21 13:00:44,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-11-21 13:00:44,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-21 13:00:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-11-21 13:00:44,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-21 13:00:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2019-11-21 13:00:44,006 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 30 [2019-11-21 13:00:44,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:00:44,006 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2019-11-21 13:00:44,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 13:00:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2019-11-21 13:00:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-21 13:00:44,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:00:44,008 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:00:44,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:44,213 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 13:00:44,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:00:44,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1392750719, now seen corresponding path program 1 times [2019-11-21 13:00:44,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:00:44,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [525314439] [2019-11-21 13:00:44,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:00:44,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 13:00:44,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:00:44,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 13:00:44,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:44,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:44,545 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:00:44,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-21 13:00:44,558 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 16 treesize of output 8 [2019-11-21 13:00:44,558 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:44,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:44,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:44,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-21 13:00:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 13:00:44,581 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:00:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 13:00:44,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [525314439] [2019-11-21 13:00:44,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:00:44,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-11-21 13:00:44,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191423593] [2019-11-21 13:00:44,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 13:00:44,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:00:44,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 13:00:44,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-21 13:00:44,619 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand 8 states. [2019-11-21 13:00:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:00:44,859 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2019-11-21 13:00:44,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 13:00:44,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-11-21 13:00:44,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:00:44,861 INFO L225 Difference]: With dead ends: 70 [2019-11-21 13:00:44,861 INFO L226 Difference]: Without dead ends: 64 [2019-11-21 13:00:44,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-21 13:00:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-21 13:00:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-21 13:00:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-21 13:00:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2019-11-21 13:00:44,865 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 31 [2019-11-21 13:00:44,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:00:44,866 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2019-11-21 13:00:44,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 13:00:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2019-11-21 13:00:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-21 13:00:44,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:00:44,867 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:00:45,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:45,068 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 13:00:45,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:00:45,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2014712896, now seen corresponding path program 1 times [2019-11-21 13:00:45,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:00:45,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1537110095] [2019-11-21 13:00:45,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:00:45,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-21 13:00:45,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:00:45,578 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2019-11-21 13:00:45,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:45,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:45,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:45,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-21 13:00:45,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-11-21 13:00:45,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:45,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:45,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:45,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:13 [2019-11-21 13:00:45,726 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:45,726 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 1 case distinctions, treesize of input 20 treesize of output 24 [2019-11-21 13:00:45,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:45,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-21 13:00:45,766 INFO L567 ElimStorePlain]: treesize reduction 9, result has 57.1 percent of original size [2019-11-21 13:00:45,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:45,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:8 [2019-11-21 13:00:45,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 13:00:45,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:45,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:45,830 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:00:45,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-11-21 13:00:45,844 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 16 treesize of output 8 [2019-11-21 13:00:45,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:45,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:45,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:45,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-11-21 13:00:45,936 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:45,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 47 [2019-11-21 13:00:45,938 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:45,981 INFO L567 ElimStorePlain]: treesize reduction 24, result has 50.0 percent of original size [2019-11-21 13:00:45,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:45,983 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:00:45,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:24 [2019-11-21 13:00:45,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:46,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-21 13:00:46,101 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:00:46,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:46,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-11-21 13:00:46,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:46,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:46,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:46,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-21 13:00:46,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:00:46,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-21 13:00:46,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:46,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-11-21 13:00:46,611 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:46,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:46,615 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:46,615 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:8 [2019-11-21 13:00:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-21 13:00:46,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1537110095] [2019-11-21 13:00:46,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:00:46,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2019-11-21 13:00:46,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613522422] [2019-11-21 13:00:46,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 13:00:46,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:00:46,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 13:00:46,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-11-21 13:00:46,670 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 22 states. [2019-11-21 13:00:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:00:47,773 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-21 13:00:47,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 13:00:47,774 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-11-21 13:00:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:00:47,775 INFO L225 Difference]: With dead ends: 63 [2019-11-21 13:00:47,775 INFO L226 Difference]: Without dead ends: 63 [2019-11-21 13:00:47,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2019-11-21 13:00:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-21 13:00:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-21 13:00:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-21 13:00:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-21 13:00:47,779 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 31 [2019-11-21 13:00:47,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:00:47,779 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-21 13:00:47,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 13:00:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-21 13:00:47,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-21 13:00:47,780 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:00:47,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:00:47,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:47,981 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr2REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, expandArrayErr4REQUIRES_VIOLATION, expandArrayErr3REQUIRES_VIOLATION, expandArrayErr2REQUIRES_VIOLATION, expandArrayErr1REQUIRES_VIOLATION, expandArrayErr0REQUIRES_VIOLATION, expandArrayErr5REQUIRES_VIOLATION]=== [2019-11-21 13:00:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:00:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 490747930, now seen corresponding path program 1 times [2019-11-21 13:00:47,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:00:47,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1700450354] [2019-11-21 13:00:47,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:00:48,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-21 13:00:48,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:00:48,365 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:00:48,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:48,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:48,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:48,368 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:00:48,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, 1 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:00:48,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:48,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:48,623 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:00:48,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2019-11-21 13:00:48,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-11-21 13:00:48,673 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:00:48,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:48,704 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:00:48,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:69 [2019-11-21 13:00:48,722 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2019-11-21 13:00:48,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:00:48,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:00:48,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:00:48,740 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:36 [2019-11-21 13:00:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:00:50,873 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:00:56,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:00:56,828 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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:00:56,834 INFO L168 Benchmark]: Toolchain (without parser) took 78825.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -60.5 MB). Peak memory consumption was 271.4 MB. Max. memory is 11.5 GB. [2019-11-21 13:00:56,835 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:00:56,835 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-21 13:00:56,836 INFO L168 Benchmark]: Boogie Preprocessor took 73.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-21 13:00:56,836 INFO L168 Benchmark]: RCFGBuilder took 768.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. [2019-11-21 13:00:56,836 INFO L168 Benchmark]: TraceAbstraction took 77273.29 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.8 MB). Peak memory consumption was 223.8 MB. Max. memory is 11.5 GB. [2019-11-21 13:00:56,838 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 705.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -134.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 768.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.1 MB). Peak memory consumption was 53.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 77273.29 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 215.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.8 MB). Peak memory consumption was 223.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...