./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eb5e103dbe59a250cbe01613b667895523582d5d --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 11:24:20,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 11:24:20,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 11:24:20,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 11:24:20,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 11:24:20,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 11:24:20,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 11:24:20,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 11:24:20,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 11:24:20,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 11:24:20,740 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 11:24:20,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 11:24:20,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 11:24:20,743 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 11:24:20,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 11:24:20,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 11:24:20,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 11:24:20,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 11:24:20,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 11:24:20,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 11:24:20,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 11:24:20,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 11:24:20,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 11:24:20,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 11:24:20,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 11:24:20,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 11:24:20,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 11:24:20,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 11:24:20,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 11:24:20,764 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 11:24:20,764 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 11:24:20,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 11:24:20,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 11:24:20,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 11:24:20,768 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 11:24:20,769 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 11:24:20,770 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 11:24:20,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 11:24:20,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 11:24:20,772 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 11:24:20,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 11:24:20,773 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-21 11:24:20,789 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 11:24:20,789 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 11:24:20,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 11:24:20,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 11:24:20,794 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 11:24:20,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 11:24:20,795 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 11:24:20,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 11:24:20,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 11:24:20,795 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 11:24:20,795 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 11:24:20,796 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 11:24:20,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 11:24:20,797 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 11:24:20,797 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 11:24:20,797 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 11:24:20,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 11:24:20,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 11:24:20,798 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 11:24:20,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 11:24:20,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 11:24:20,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 11:24:20,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 11:24:20,799 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 11:24:20,800 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 11:24:20,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 11:24:20,801 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eb5e103dbe59a250cbe01613b667895523582d5d Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 11:24:21,100 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 11:24:21,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 11:24:21,126 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 11:24:21,128 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 11:24:21,128 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 11:24:21,129 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2019-11-21 11:24:21,201 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5b88d64/29e2fea037ed4aa5bf7ab741c2413407/FLAG052d365dc [2019-11-21 11:24:21,730 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 11:24:21,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2019-11-21 11:24:21,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5b88d64/29e2fea037ed4aa5bf7ab741c2413407/FLAG052d365dc [2019-11-21 11:24:22,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd5b88d64/29e2fea037ed4aa5bf7ab741c2413407 [2019-11-21 11:24:22,161 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 11:24:22,162 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 11:24:22,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 11:24:22,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 11:24:22,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 11:24:22,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:24:22" (1/1) ... [2019-11-21 11:24:22,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32184a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22, skipping insertion in model container [2019-11-21 11:24:22,171 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:24:22" (1/1) ... [2019-11-21 11:24:22,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 11:24:22,213 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:24:22,619 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 11:24:22,619 INFO L969 CHandler]: at location: C: (int *)malloc(sizeof(int)) [518] [2019-11-21 11:24:22,619 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:24:22,621 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 11:24:22,622 INFO L969 CHandler]: at location: C: (int *)malloc(sizeof(int)) [519] [2019-11-21 11:24:22,622 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:24:22,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:24:22,660 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 11:24:22,673 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:24:22,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:24:22,724 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 11:24:22,758 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:24:22,812 INFO L205 MainTranslator]: Completed translation [2019-11-21 11:24:22,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22 WrapperNode [2019-11-21 11:24:22,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 11:24:22,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 11:24:22,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 11:24:22,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 11:24:22,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22" (1/1) ... [2019-11-21 11:24:22,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22" (1/1) ... [2019-11-21 11:24:22,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22" (1/1) ... [2019-11-21 11:24:22,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22" (1/1) ... [2019-11-21 11:24:22,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22" (1/1) ... [2019-11-21 11:24:22,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22" (1/1) ... [2019-11-21 11:24:22,908 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22" (1/1) ... [2019-11-21 11:24:22,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 11:24:22,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 11:24:22,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 11:24:22,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 11:24:22,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 11:24:22,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 11:24:22,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 11:24:22,987 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 11:24:22,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 11:24:22,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 11:24:22,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 11:24:22,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 11:24:22,989 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-11-21 11:24:22,989 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-11-21 11:24:22,991 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 11:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-21 11:24:22,991 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 11:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 11:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 11:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 11:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 11:24:22,992 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 11:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 11:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 11:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 11:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 11:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 11:24:22,993 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 11:24:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 11:24:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 11:24:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 11:24:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 11:24:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 11:24:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 11:24:22,994 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 11:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 11:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 11:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 11:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 11:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 11:24:22,995 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 11:24:22,996 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 11:24:22,996 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 11:24:22,996 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 11:24:22,996 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 11:24:22,996 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 11:24:22,996 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 11:24:22,997 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 11:24:22,997 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 11:24:22,997 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 11:24:22,997 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 11:24:22,997 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 11:24:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 11:24:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 11:24:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 11:24:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 11:24:22,998 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 11:24:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 11:24:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 11:24:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 11:24:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 11:24:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 11:24:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 11:24:22,999 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 11:24:23,000 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 11:24:23,000 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 11:24:23,001 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 11:24:23,001 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 11:24:23,002 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 11:24:23,002 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 11:24:23,002 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 11:24:23,004 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 11:24:23,004 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 11:24:23,004 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 11:24:23,004 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 11:24:23,004 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 11:24:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 11:24:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 11:24:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 11:24:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 11:24:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 11:24:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 11:24:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 11:24:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 11:24:23,006 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 11:24:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 11:24:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 11:24:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 11:24:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 11:24:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 11:24:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 11:24:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 11:24:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 11:24:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 11:24:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 11:24:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 11:24:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 11:24:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 11:24:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 11:24:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 11:24:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 11:24:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 11:24:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 11:24:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 11:24:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 11:24:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 11:24:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 11:24:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 11:24:23,010 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 11:24:23,010 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 11:24:23,010 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 11:24:23,010 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 11:24:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 11:24:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 11:24:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 11:24:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 11:24:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 11:24:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 11:24:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 11:24:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 11:24:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 11:24:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 11:24:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 11:24:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-11-21 11:24:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 11:24:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 11:24:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 11:24:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 11:24:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-11-21 11:24:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 11:24:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 11:24:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 11:24:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 11:24:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 11:24:23,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 11:24:23,681 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 11:24:23,681 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-21 11:24:23,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:24:23 BoogieIcfgContainer [2019-11-21 11:24:23,682 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 11:24:23,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 11:24:23,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 11:24:23,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 11:24:23,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:24:22" (1/3) ... [2019-11-21 11:24:23,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170ee7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:24:23, skipping insertion in model container [2019-11-21 11:24:23,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:24:22" (2/3) ... [2019-11-21 11:24:23,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170ee7af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:24:23, skipping insertion in model container [2019-11-21 11:24:23,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:24:23" (3/3) ... [2019-11-21 11:24:23,693 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019_1-1.i [2019-11-21 11:24:23,700 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 11:24:23,707 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2019-11-21 11:24:23,718 INFO L249 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2019-11-21 11:24:23,739 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 11:24:23,739 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 11:24:23,739 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 11:24:23,739 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 11:24:23,740 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 11:24:23,740 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 11:24:23,740 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 11:24:23,740 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 11:24:23,758 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-11-21 11:24:23,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 11:24:23,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:24:23,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:24:23,769 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 11:24:23,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:24:23,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1782233127, now seen corresponding path program 1 times [2019-11-21 11:24:23,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:24:23,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [223903342] [2019-11-21 11:24:23,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:24:24,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 11:24:24,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:24:24,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 11:24:24,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:24,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:24,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:24,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:24:24,257 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:24,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-21 11:24:24,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:24,291 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-21 11:24:24,292 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:24:24,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-21 11:24:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:24,327 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:24:24,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:24,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [223903342] [2019-11-21 11:24:24,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:24:24,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:24:24,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329976461] [2019-11-21 11:24:24,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:24:24,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:24:24,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:24:24,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:24:24,396 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 5 states. [2019-11-21 11:24:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:24:24,761 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-11-21 11:24:24,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:24:24,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-21 11:24:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:24:24,777 INFO L225 Difference]: With dead ends: 70 [2019-11-21 11:24:24,777 INFO L226 Difference]: Without dead ends: 67 [2019-11-21 11:24:24,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:24:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-21 11:24:24,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-21 11:24:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-21 11:24:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-11-21 11:24:24,829 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 9 [2019-11-21 11:24:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:24:24,830 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-11-21 11:24:24,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:24:24,830 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-11-21 11:24:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-21 11:24:24,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:24:24,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:24:25,033 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:25,034 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 11:24:25,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:24:25,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1782233128, now seen corresponding path program 1 times [2019-11-21 11:24:25,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:24:25,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1247463427] [2019-11-21 11:24:25,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:25,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:24:25,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 11:24:25,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:24:25,255 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 11:24:25,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:25,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:25,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 11:24:25,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:25,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:25,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:25,288 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 11:24:25,345 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:25,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-21 11:24:25,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:25,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:25,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 11:24:25,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:25,397 INFO L567 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-21 11:24:25,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:24:25,399 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-21 11:24:25,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:25,423 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:24:25,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:24:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:25,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1247463427] [2019-11-21 11:24:25,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:24:25,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-21 11:24:25,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837768691] [2019-11-21 11:24:25,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 11:24:25,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:24:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 11:24:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 11:24:25,771 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 8 states. [2019-11-21 11:24:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:24:26,679 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-11-21 11:24:26,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:24:26,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-21 11:24:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:24:26,681 INFO L225 Difference]: With dead ends: 66 [2019-11-21 11:24:26,681 INFO L226 Difference]: Without dead ends: 66 [2019-11-21 11:24:26,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:24:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-21 11:24:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-21 11:24:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-21 11:24:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-11-21 11:24:26,691 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 9 [2019-11-21 11:24:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:24:26,692 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-11-21 11:24:26,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 11:24:26,692 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-11-21 11:24:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-21 11:24:26,693 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:24:26,693 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:24:26,895 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:26,896 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 11:24:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:24:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -965916439, now seen corresponding path program 1 times [2019-11-21 11:24:26,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:24:26,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1722307453] [2019-11-21 11:24:26,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:24:27,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 11:24:27,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:24:27,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 11:24:27,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:27,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 11:24:27,117 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:27,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:27,128 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 11:24:27,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:24:27,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 11:24:27,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:27,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:24:27,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 11:24:27,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:27,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:24:27,234 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-21 11:24:27,316 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_67|], 3=[|v_#length_43|]} [2019-11-21 11:24:27,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 11:24:27,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:27,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,391 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-21 11:24:27,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:27,430 INFO L567 ElimStorePlain]: treesize reduction 28, result has 40.4 percent of original size [2019-11-21 11:24:27,431 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:24:27,431 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2019-11-21 11:24:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:27,449 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:24:27,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:24:27,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:24:27,658 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2019-11-21 11:24:27,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:27,683 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2019-11-21 11:24:27,685 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:27,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-11-21 11:24:27,709 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:27,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:27,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2019-11-21 11:24:27,761 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:53 [2019-11-21 11:24:27,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:24:28,373 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 11:24:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:28,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1722307453] [2019-11-21 11:24:28,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:24:28,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 10 [2019-11-21 11:24:28,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247142576] [2019-11-21 11:24:28,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 11:24:28,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:24:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 11:24:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-21 11:24:28,392 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 11 states. [2019-11-21 11:24:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:24:29,319 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-11-21 11:24:29,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:24:29,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-11-21 11:24:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:24:29,322 INFO L225 Difference]: With dead ends: 63 [2019-11-21 11:24:29,322 INFO L226 Difference]: Without dead ends: 63 [2019-11-21 11:24:29,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-21 11:24:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-21 11:24:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-21 11:24:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-21 11:24:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-11-21 11:24:29,330 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 11 [2019-11-21 11:24:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:24:29,330 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-11-21 11:24:29,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 11:24:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-11-21 11:24:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 11:24:29,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:24:29,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:24:29,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:29,535 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 11:24:29,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:24:29,535 INFO L82 PathProgramCache]: Analyzing trace with hash -532763157, now seen corresponding path program 1 times [2019-11-21 11:24:29,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:24:29,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1072895112] [2019-11-21 11:24:29,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:24:29,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 11:24:29,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:24:29,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 11:24:29,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:29,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:29,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:29,778 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 11:24:29,797 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 11:24:29,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:29,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:29,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:29,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-21 11:24:29,927 INFO L343 Elim1Store]: treesize reduction 12, result has 86.2 percent of original size [2019-11-21 11:24:29,928 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 91 [2019-11-21 11:24:29,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:29,991 INFO L567 ElimStorePlain]: treesize reduction 40, result has 46.7 percent of original size [2019-11-21 11:24:29,992 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:29,993 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:35 [2019-11-21 11:24:30,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:24:30,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-11-21 11:24:30,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:30,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:30,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:30,077 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:55 [2019-11-21 11:24:30,124 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2019-11-21 11:24:30,126 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:24:30,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:30,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:24:30,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:28 [2019-11-21 11:24:30,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:30,171 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:24:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:30,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1072895112] [2019-11-21 11:24:30,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:24:30,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 12 [2019-11-21 11:24:30,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538497507] [2019-11-21 11:24:30,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 11:24:30,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:24:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 11:24:30,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-21 11:24:30,330 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 13 states. [2019-11-21 11:24:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:24:31,120 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-11-21 11:24:31,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 11:24:31,121 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-11-21 11:24:31,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:24:31,122 INFO L225 Difference]: With dead ends: 62 [2019-11-21 11:24:31,122 INFO L226 Difference]: Without dead ends: 62 [2019-11-21 11:24:31,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2019-11-21 11:24:31,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-21 11:24:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-21 11:24:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-21 11:24:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-11-21 11:24:31,130 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 13 [2019-11-21 11:24:31,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:24:31,130 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-11-21 11:24:31,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 11:24:31,130 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-11-21 11:24:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-21 11:24:31,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:24:31,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:24:31,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:31,332 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 11:24:31,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:24:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash -532763156, now seen corresponding path program 1 times [2019-11-21 11:24:31,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:24:31,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [65533287] [2019-11-21 11:24:31,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:24:31,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 11:24:31,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:24:31,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 11:24:31,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 11:24:31,561 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-11-21 11:24:31,602 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 11:24:31,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,635 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 11:24:31,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,655 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2019-11-21 11:24:31,698 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2019-11-21 11:24:31,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2019-11-21 11:24:31,721 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,734 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,734 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:33 [2019-11-21 11:24:31,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:24:31,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2019-11-21 11:24:31,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:24:31,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 11:24:31,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,839 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-21 11:24:31,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2019-11-21 11:24:31,890 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:24:31,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:24:31,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:31,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:31,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:24:31,935 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:18 [2019-11-21 11:24:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:31,964 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:24:32,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:24:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:32,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [65533287] [2019-11-21 11:24:32,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:24:32,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 12 [2019-11-21 11:24:32,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616832358] [2019-11-21 11:24:32,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 11:24:32,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:24:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 11:24:32,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-21 11:24:32,452 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 13 states. [2019-11-21 11:24:32,999 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-11-21 11:24:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:24:33,630 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-11-21 11:24:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 11:24:33,631 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-11-21 11:24:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:24:33,633 INFO L225 Difference]: With dead ends: 61 [2019-11-21 11:24:33,633 INFO L226 Difference]: Without dead ends: 61 [2019-11-21 11:24:33,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-21 11:24:33,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-21 11:24:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-21 11:24:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-21 11:24:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-11-21 11:24:33,641 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 13 [2019-11-21 11:24:33,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:24:33,641 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-11-21 11:24:33,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 11:24:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-11-21 11:24:33,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 11:24:33,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:24:33,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:24:33,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:33,846 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr4REQUIRES_VIOLATION, alloc_dataErr9REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr8REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr7REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr6REQUIRES_VIOLATION, alloc_dataErr11REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, alloc_dataErr5REQUIRES_VIOLATION, alloc_dataErr10REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr17REQUIRES_VIOLATION, free_dataErr6REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr16REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr15REQUIRES_VIOLATION, free_dataErr4REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr14REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-11-21 11:24:33,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:24:33,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1643053418, now seen corresponding path program 1 times [2019-11-21 11:24:33,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:24:33,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1493062977] [2019-11-21 11:24:33,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:24:34,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 11:24:34,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:24:34,189 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 11:24:34,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:34,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-21 11:24:34,237 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:34,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-21 11:24:34,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,265 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-21 11:24:34,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2019-11-21 11:24:34,287 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_32|], 2=[|v_#memory_$Pointer$.offset_31|]} [2019-11-21 11:24:34,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-21 11:24:34,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:34,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:24:34,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-21 11:24:34,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:34,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,356 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-21 11:24:34,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:24:34,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:34,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:32 [2019-11-21 11:24:34,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:24:34,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:24:34,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:24:34,504 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:34,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 87 [2019-11-21 11:24:34,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,543 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-11-21 11:24:34,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:60 [2019-11-21 11:24:34,608 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:34,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 57 treesize of output 28 [2019-11-21 11:24:34,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:24:34,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:34,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:24:34,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:13 [2019-11-21 11:24:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:24:34,671 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:24:34,735 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:24:34,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:24:34,765 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 11:24:34,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:66, output treesize:64 [2019-11-21 11:24:55,276 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-21 11:24:57,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_1 (_ BitVec 32))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_alloc_data_~pdata.base) c_alloc_data_~pdata.offset))) (let ((.cse1 (select |c_#memory_$Pointer$.base| .cse0)) (.cse2 (select (select |c_#memory_$Pointer$.offset| c_alloc_data_~pdata.base) c_alloc_data_~pdata.offset))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 .cse2 v_DerPreprocessor_1)))) (or (not (= (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 (bvadd .cse2 (_ bv2 32)) v_DerPreprocessor_1)) .cse3)) (not (= .cse3 (store |c_#memory_$Pointer$.base| .cse0 (store .cse1 (bvadd .cse2 (_ bv1 32)) v_DerPreprocessor_1)))) (= (_ bv1 1) (select |c_#valid| (select (select .cse3 c_alloc_data_~pdata.base) (bvadd c_alloc_data_~pdata.offset (_ bv8 32)))))))))) is different from false [2019-11-21 11:24:57,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:24:57,537 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 11:24:57,543 INFO L168 Benchmark]: Toolchain (without parser) took 35381.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 955.0 MB in the beginning and 1.3 GB in the end (delta: -320.5 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-11-21 11:24:57,544 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 11:24:57,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-21 11:24:57,545 INFO L168 Benchmark]: Boogie Preprocessor took 100.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-21 11:24:57,546 INFO L168 Benchmark]: RCFGBuilder took 767.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-11-21 11:24:57,546 INFO L168 Benchmark]: TraceAbstraction took 33858.67 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -230.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 11:24:57,549 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.51 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 649.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 767.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33858.67 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 188.2 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -230.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...