./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-1.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86b203c3a804c103d90401bd32cfcff28939b920 --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 12:21:17,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:21:17,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:21:17,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:21:17,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:21:17,757 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:21:17,759 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:21:17,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:21:17,763 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:21:17,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:21:17,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:21:17,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:21:17,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:21:17,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:21:17,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:21:17,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:21:17,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:21:17,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:21:17,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:21:17,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:21:17,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:21:17,782 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:21:17,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:21:17,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:21:17,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:21:17,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:21:17,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:21:17,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:21:17,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:21:17,795 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:21:17,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:21:17,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:21:17,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:21:17,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:21:17,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:21:17,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:21:17,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:21:17,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:21:17,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:21:17,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:21:17,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:21:17,804 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 12:21:17,831 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:21:17,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:21:17,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:21:17,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:21:17,838 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:21:17,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:21:17,838 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 12:21:17,838 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:21:17,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:21:17,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 12:21:17,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:21:17,841 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:21:17,841 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:21:17,841 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 12:21:17,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:21:17,842 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:21:17,842 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:21:17,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 12:21:17,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:21:17,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:21:17,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:21:17,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:21:17,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:21:17,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:21:17,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:21:17,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:21:17,846 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:21:17,846 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:21:17,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:21:17,847 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86b203c3a804c103d90401bd32cfcff28939b920 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 12:21:18,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:21:18,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:21:18,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:21:18,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:21:18,177 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:21:18,178 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-1.i [2019-11-21 12:21:18,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16acef767/e64a4eb328b14246a6c5d3613ed3f6ad/FLAG51d65ed1a [2019-11-21 12:21:18,831 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:21:18,835 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_shallow_copy-1.i [2019-11-21 12:21:18,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16acef767/e64a4eb328b14246a6c5d3613ed3f6ad/FLAG51d65ed1a [2019-11-21 12:21:19,105 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16acef767/e64a4eb328b14246a6c5d3613ed3f6ad [2019-11-21 12:21:19,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:21:19,110 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:21:19,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:21:19,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:21:19,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:21:19,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e3f9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19, skipping insertion in model container [2019-11-21 12:21:19,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:21:19,188 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:21:19,596 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:21:19,596 INFO L969 CHandler]: at location: C: (struct node*) malloc(sizeof(struct node)) [562] [2019-11-21 12:21:19,597 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:21:19,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:21:19,630 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:21:19,640 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:21:19,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:21:19,688 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:21:19,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:21:19,828 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:21:19,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19 WrapperNode [2019-11-21 12:21:19,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:21:19,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:21:19,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:21:19,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:21:19,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:21:19,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:21:19,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:21:19,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:21:19,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:21:19,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:21:19,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:21:19,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 12:21:19,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 12:21:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-21 12:21:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_node [2019-11-21 12:21:19,969 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:21:19,969 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 12:21:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 12:21:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 12:21:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 12:21:19,970 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 12:21:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 12:21:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 12:21:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 12:21:19,971 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 12:21:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 12:21:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 12:21:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 12:21:19,972 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 12:21:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 12:21:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 12:21:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 12:21:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 12:21:19,973 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 12:21:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 12:21:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 12:21:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 12:21:19,974 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 12:21:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 12:21:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 12:21:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 12:21:19,975 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 12:21:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 12:21:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 12:21:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 12:21:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 12:21:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 12:21:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 12:21:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 12:21:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 12:21:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 12:21:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 12:21:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 12:21:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 12:21:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 12:21:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 12:21:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 12:21:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 12:21:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 12:21:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 12:21:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 12:21:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 12:21:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 12:21:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 12:21:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 12:21:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 12:21:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 12:21:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 12:21:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:21:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 12:21:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 12:21:19,982 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:21:19,982 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-21 12:21:19,982 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 12:21:19,982 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 12:21:19,983 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 12:21:19,983 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 12:21:19,983 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 12:21:19,983 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 12:21:19,983 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 12:21:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 12:21:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 12:21:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 12:21:19,984 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 12:21:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 12:21:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 12:21:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 12:21:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 12:21:19,985 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 12:21:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 12:21:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 12:21:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 12:21:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 12:21:19,986 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 12:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 12:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 12:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 12:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 12:21:19,987 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 12:21:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 12:21:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 12:21:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 12:21:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 12:21:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 12:21:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 12:21:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 12:21:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 12:21:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 12:21:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 12:21:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 12:21:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 12:21:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 12:21:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 12:21:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 12:21:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 12:21:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 12:21:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 12:21:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 12:21:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 12:21:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 12:21:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 12:21:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-21 12:21:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_node [2019-11-21 12:21:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:21:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:21:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:21:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:21:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:21:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:21:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:21:20,351 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-21 12:21:20,536 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:21:20,537 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-21 12:21:20,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:21:20 BoogieIcfgContainer [2019-11-21 12:21:20,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:21:20,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:21:20,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:21:20,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:21:20,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:21:19" (1/3) ... [2019-11-21 12:21:20,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98bdb32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:21:20, skipping insertion in model container [2019-11-21 12:21:20,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19" (2/3) ... [2019-11-21 12:21:20,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@98bdb32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:21:20, skipping insertion in model container [2019-11-21 12:21:20,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:21:20" (3/3) ... [2019-11-21 12:21:20,552 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_shallow_copy-1.i [2019-11-21 12:21:20,562 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:21:20,576 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2019-11-21 12:21:20,597 INFO L249 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2019-11-21 12:21:20,619 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:21:20,619 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:21:20,620 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:21:20,620 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:21:20,620 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:21:20,620 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:21:20,620 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:21:20,620 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:21:20,634 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-11-21 12:21:20,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:21:20,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:20,646 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:20,647 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:20,654 INFO L82 PathProgramCache]: Analyzing trace with hash 975324898, now seen corresponding path program 1 times [2019-11-21 12:21:20,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:20,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1739680934] [2019-11-21 12:21:20,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:21:20,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 12:21:20,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:21,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 12:21:21,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:21,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:21,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:21:21,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:21:21,167 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:21,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-21 12:21:21,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:21,209 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 12:21:21,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:21:21,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 12:21:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:21,259 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:23,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:23,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1739680934] [2019-11-21 12:21:23,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:21:23,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-21 12:21:23,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278691133] [2019-11-21 12:21:23,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 12:21:23,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:23,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 12:21:23,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=172, Unknown=1, NotChecked=0, Total=210 [2019-11-21 12:21:23,781 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 15 states. [2019-11-21 12:21:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:30,699 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-11-21 12:21:30,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 12:21:30,702 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 19 [2019-11-21 12:21:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:30,710 INFO L225 Difference]: With dead ends: 43 [2019-11-21 12:21:30,710 INFO L226 Difference]: Without dead ends: 37 [2019-11-21 12:21:30,711 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=75, Invalid=304, Unknown=1, NotChecked=0, Total=380 [2019-11-21 12:21:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-21 12:21:30,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-21 12:21:30,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-21 12:21:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-11-21 12:21:30,748 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 19 [2019-11-21 12:21:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:30,750 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-11-21 12:21:30,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 12:21:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-11-21 12:21:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:21:30,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:30,753 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:30,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:30,961 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:30,962 INFO L82 PathProgramCache]: Analyzing trace with hash 975324899, now seen corresponding path program 1 times [2019-11-21 12:21:30,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:30,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1108017603] [2019-11-21 12:21:30,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:21:31,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-21 12:21:31,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:31,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 12:21:31,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:31,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:31,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 12:21:31,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:31,211 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:31,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:21:31,211 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:21:31,372 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:31,373 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 12:21:31,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:31,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:31,394 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 12:21:31,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:31,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:31,406 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 12:21:31,406 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:18 [2019-11-21 12:21:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:31,441 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:31,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:21:31,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:21:31,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:21:31,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:21:31,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:21:31,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:21:31,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:21:31,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:21:33,202 WARN L192 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 56 DAG size of output: 31 [2019-11-21 12:21:33,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:21:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:35,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1108017603] [2019-11-21 12:21:35,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:21:35,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2019-11-21 12:21:35,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597513561] [2019-11-21 12:21:35,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 12:21:35,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:35,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 12:21:35,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:21:35,688 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2019-11-21 12:21:45,282 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:21:51,414 WARN L192 SmtUtils]: Spent 831.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 12:21:52,644 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 12:21:54,690 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 12:22:02,650 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-21 12:22:07,408 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-11-21 12:22:08,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:22:08,549 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-11-21 12:22:08,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:22:08,550 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-11-21 12:22:08,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:22:08,551 INFO L225 Difference]: With dead ends: 34 [2019-11-21 12:22:08,551 INFO L226 Difference]: Without dead ends: 34 [2019-11-21 12:22:08,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=93, Invalid=412, Unknown=1, NotChecked=0, Total=506 [2019-11-21 12:22:08,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-21 12:22:08,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-21 12:22:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-21 12:22:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-11-21 12:22:08,559 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 19 [2019-11-21 12:22:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:22:08,559 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-11-21 12:22:08,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 12:22:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-11-21 12:22:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 12:22:08,560 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:22:08,561 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:22:08,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:08,762 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-21 12:22:08,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:22:08,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1078432802, now seen corresponding path program 1 times [2019-11-21 12:22:08,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:22:08,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [482983543] [2019-11-21 12:22:08,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:22:08,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-21 12:22:08,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:22:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-21 12:22:08,959 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:22:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-21 12:22:08,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [482983543] [2019-11-21 12:22:08,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:22:08,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:22:08,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607232788] [2019-11-21 12:22:08,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 12:22:08,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:22:08,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 12:22:08,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:22:08,973 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 3 states. [2019-11-21 12:22:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:22:09,013 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-11-21 12:22:09,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:22:09,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-21 12:22:09,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:22:09,015 INFO L225 Difference]: With dead ends: 33 [2019-11-21 12:22:09,015 INFO L226 Difference]: Without dead ends: 33 [2019-11-21 12:22:09,016 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:22:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-21 12:22:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-21 12:22:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-21 12:22:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-11-21 12:22:09,021 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 24 [2019-11-21 12:22:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:22:09,022 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-11-21 12:22:09,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 12:22:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-11-21 12:22:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 12:22:09,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:22:09,024 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:22:09,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:09,226 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-21 12:22:09,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:22:09,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1286805155, now seen corresponding path program 1 times [2019-11-21 12:22:09,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:22:09,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [902243827] [2019-11-21 12:22:09,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:22:09,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:22:09,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:22:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:22:09,406 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:22:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:22:09,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [902243827] [2019-11-21 12:22:09,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:22:09,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-21 12:22:09,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329842864] [2019-11-21 12:22:09,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:22:09,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:22:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:22:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:22:09,453 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 6 states. [2019-11-21 12:22:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:22:09,516 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-11-21 12:22:09,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:22:09,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-21 12:22:09,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:22:09,518 INFO L225 Difference]: With dead ends: 32 [2019-11-21 12:22:09,518 INFO L226 Difference]: Without dead ends: 32 [2019-11-21 12:22:09,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-21 12:22:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-21 12:22:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-21 12:22:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-21 12:22:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-11-21 12:22:09,524 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2019-11-21 12:22:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:22:09,525 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-11-21 12:22:09,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:22:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-11-21 12:22:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-21 12:22:09,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:22:09,526 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:22:09,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:09,729 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-21 12:22:09,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:22:09,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1236254071, now seen corresponding path program 1 times [2019-11-21 12:22:09,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:22:09,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [301902839] [2019-11-21 12:22:09,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:22:09,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:22:09,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:22:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:22:09,998 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:22:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:22:10,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [301902839] [2019-11-21 12:22:10,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:22:10,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2019-11-21 12:22:10,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800986825] [2019-11-21 12:22:10,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 12:22:10,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:22:10,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 12:22:10,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-21 12:22:10,115 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 11 states. [2019-11-21 12:22:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:22:10,331 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-11-21 12:22:10,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 12:22:10,332 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-11-21 12:22:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:22:10,333 INFO L225 Difference]: With dead ends: 31 [2019-11-21 12:22:10,333 INFO L226 Difference]: Without dead ends: 31 [2019-11-21 12:22:10,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:22:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-21 12:22:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-21 12:22:10,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-21 12:22:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-11-21 12:22:10,338 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-11-21 12:22:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:22:10,339 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-11-21 12:22:10,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 12:22:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-11-21 12:22:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 12:22:10,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:22:10,341 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:22:10,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:10,549 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-21 12:22:10,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:22:10,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1665781067, now seen corresponding path program 1 times [2019-11-21 12:22:10,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:22:10,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1779927116] [2019-11-21 12:22:10,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:22:10,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 12:22:10,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:22:10,760 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 12:22:10,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:10,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:10,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:10,763 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-21 12:22:10,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-21 12:22:10,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:10,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:10,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:10,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:7 [2019-11-21 12:22:10,808 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 12:22:10,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:10,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:10,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:10,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-21 12:22:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:22:10,829 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:22:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:22:10,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1779927116] [2019-11-21 12:22:10,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:22:10,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2019-11-21 12:22:10,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289607483] [2019-11-21 12:22:10,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 12:22:10,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:22:10,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 12:22:10,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:22:10,893 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 10 states. [2019-11-21 12:22:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:22:11,074 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-11-21 12:22:11,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 12:22:11,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-21 12:22:11,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:22:11,076 INFO L225 Difference]: With dead ends: 30 [2019-11-21 12:22:11,076 INFO L226 Difference]: Without dead ends: 30 [2019-11-21 12:22:11,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-21 12:22:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-21 12:22:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-21 12:22:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-21 12:22:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-11-21 12:22:11,080 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 29 [2019-11-21 12:22:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:22:11,081 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-11-21 12:22:11,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 12:22:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-11-21 12:22:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-21 12:22:11,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:22:11,082 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:22:11,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:11,283 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-21 12:22:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:22:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash 99605601, now seen corresponding path program 1 times [2019-11-21 12:22:11,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:22:11,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [114228994] [2019-11-21 12:22:11,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:22:11,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 12:22:11,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:22:11,552 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 12:22:11,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:11,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:11,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:11,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2019-11-21 12:22:11,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-21 12:22:11,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:11,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:11,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:11,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2019-11-21 12:22:11,643 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 12:22:11,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:11,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:11,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:11,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-11-21 12:22:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:22:11,701 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:22:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:22:11,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [114228994] [2019-11-21 12:22:11,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:22:11,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-11-21 12:22:11,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652088577] [2019-11-21 12:22:11,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-21 12:22:11,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:22:11,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-21 12:22:11,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-11-21 12:22:11,880 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 17 states. [2019-11-21 12:22:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:22:12,428 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-11-21 12:22:12,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:22:12,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-11-21 12:22:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:22:12,431 INFO L225 Difference]: With dead ends: 29 [2019-11-21 12:22:12,431 INFO L226 Difference]: Without dead ends: 29 [2019-11-21 12:22:12,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2019-11-21 12:22:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-21 12:22:12,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-21 12:22:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-21 12:22:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-11-21 12:22:12,436 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 30 [2019-11-21 12:22:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:22:12,436 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-11-21 12:22:12,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-21 12:22:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-11-21 12:22:12,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-21 12:22:12,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:22:12,438 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:22:12,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:12,642 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-21 12:22:12,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:22:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1207193587, now seen corresponding path program 1 times [2019-11-21 12:22:12,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:22:12,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1551730297] [2019-11-21 12:22:12,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:22:12,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-21 12:22:12,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:22:12,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 12:22:12,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:12,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:12,843 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:12,843 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:22:12,940 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:12,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-21 12:22:12,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:12,965 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 12:22:12,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:12,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-21 12:22:12,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 12:22:12,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:13,018 INFO L567 ElimStorePlain]: treesize reduction 5, result has 83.9 percent of original size [2019-11-21 12:22:13,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:13,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:25 [2019-11-21 12:22:13,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-11-21 12:22:13,074 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:13,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:13,082 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:13,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:27 [2019-11-21 12:22:13,106 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 25 treesize of output 13 [2019-11-21 12:22:13,107 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:13,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:13,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:13,120 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2019-11-21 12:22:13,189 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 0 case distinctions, treesize of input 21 treesize of output 21 [2019-11-21 12:22:13,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:13,207 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-21 12:22:13,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:22:13,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-11-21 12:22:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:22:13,245 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:22:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:22:13,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1551730297] [2019-11-21 12:22:13,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 12:22:13,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 23 [2019-11-21 12:22:13,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065861641] [2019-11-21 12:22:13,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 12:22:13,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:22:13,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 12:22:13,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2019-11-21 12:22:13,649 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2019-11-21 12:22:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:22:14,203 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-11-21 12:22:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-21 12:22:14,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2019-11-21 12:22:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:22:14,205 INFO L225 Difference]: With dead ends: 28 [2019-11-21 12:22:14,205 INFO L226 Difference]: Without dead ends: 28 [2019-11-21 12:22:14,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2019-11-21 12:22:14,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-21 12:22:14,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-21 12:22:14,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-21 12:22:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-11-21 12:22:14,210 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 31 [2019-11-21 12:22:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:22:14,211 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-11-21 12:22:14,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 12:22:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-11-21 12:22:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 12:22:14,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:22:14,212 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:22:14,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:14,415 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr14ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr8ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr9ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-11-21 12:22:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:22:14,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1231704548, now seen corresponding path program 1 times [2019-11-21 12:22:14,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:22:14,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1530000353] [2019-11-21 12:22:14,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:22:14,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 12:22:14,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:22:14,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 12:22:14,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:14,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:14,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:14,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:22:14,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 12:22:14,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:14,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:14,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:14,880 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:44 [2019-11-21 12:22:15,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 29 [2019-11-21 12:22:15,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:15,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:15,025 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:15,026 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2019-11-21 12:22:15,032 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 41 treesize of output 25 [2019-11-21 12:22:15,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:15,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:15,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:15,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:32 [2019-11-21 12:22:15,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:22:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-21 12:22:17,283 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:22:17,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:22:30,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:22:30,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:30,416 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 12:22:30,422 INFO L168 Benchmark]: Toolchain (without parser) took 71313.20 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 255.9 MB). Free memory was 955.0 MB in the beginning and 927.3 MB in the end (delta: 27.7 MB). Peak memory consumption was 283.5 MB. Max. memory is 11.5 GB. [2019-11-21 12:22:30,423 INFO L168 Benchmark]: CDTParser took 0.27 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 12:22:30,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-21 12:22:30,424 INFO L168 Benchmark]: Boogie Preprocessor took 68.38 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-21 12:22:30,425 INFO L168 Benchmark]: RCFGBuilder took 639.85 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. [2019-11-21 12:22:30,425 INFO L168 Benchmark]: TraceAbstraction took 69881.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 927.3 MB in the end (delta: 145.1 MB). Peak memory consumption was 247.4 MB. Max. memory is 11.5 GB. [2019-11-21 12:22:30,435 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 715.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.38 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 639.85 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: 43.6 MB). Peak memory consumption was 43.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 69881.68 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 102.2 MB). Free memory was 1.1 GB in the beginning and 927.3 MB in the end (delta: 145.1 MB). Peak memory consumption was 247.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...