./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 91b1670e Calling Ultimate with: 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 /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.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 dd0b9292151174331f3cf63e5ad3d651d29dfbcc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.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 dd0b9292151174331f3cf63e5ad3d651d29dfbcc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 22:48:56,149 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:48:56,151 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:48:56,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:48:56,165 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:48:56,166 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:48:56,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:48:56,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:48:56,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:48:56,177 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:48:56,180 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:48:56,180 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:48:56,181 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:48:56,182 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:48:56,183 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:48:56,184 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:48:56,185 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:48:56,186 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:48:56,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:48:56,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:48:56,191 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:48:56,192 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:48:56,194 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:48:56,195 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:48:56,195 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:48:56,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:48:56,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:48:56,197 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:48:56,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:48:56,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:48:56,200 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:48:56,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:48:56,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:48:56,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:48:56,206 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:48:56,207 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:48:56,207 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 22:48:56,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:48:56,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:48:56,242 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:48:56,242 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:48:56,243 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:48:56,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:48:56,244 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:48:56,244 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:48:56,244 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:48:56,245 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:48:56,245 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:48:56,245 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:48:56,245 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:48:56,245 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:48:56,245 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:48:56,245 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:48:56,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:48:56,249 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:48:56,249 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:48:56,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:48:56,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:48:56,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:48:56,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:48:56,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:48:56,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:48:56,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:48:56,250 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 22:48:56,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:48:56,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-11-28 22:48:56,302 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:48:56,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:48:56,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:48:56,329 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:48:56,329 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:48:56,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 22:48:56,388 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67c3c874/6cd255a6966840f392cd8e8ad8d82ad1/FLAG0f86ba26f [2018-11-28 22:48:56,880 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:48:56,881 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 22:48:56,901 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67c3c874/6cd255a6966840f392cd8e8ad8d82ad1/FLAG0f86ba26f [2018-11-28 22:48:57,175 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f67c3c874/6cd255a6966840f392cd8e8ad8d82ad1 [2018-11-28 22:48:57,179 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:48:57,181 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:48:57,181 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:48:57,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:48:57,186 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:48:57,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:48:57" (1/1) ... [2018-11-28 22:48:57,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f1d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57, skipping insertion in model container [2018-11-28 22:48:57,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:48:57" (1/1) ... [2018-11-28 22:48:57,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:48:57,258 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:48:57,650 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:48:57,662 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:48:57,724 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:48:57,872 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:48:57,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57 WrapperNode [2018-11-28 22:48:57,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:48:57,875 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:48:57,875 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:48:57,875 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:48:57,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57" (1/1) ... [2018-11-28 22:48:57,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57" (1/1) ... [2018-11-28 22:48:57,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57" (1/1) ... [2018-11-28 22:48:57,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57" (1/1) ... [2018-11-28 22:48:57,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57" (1/1) ... [2018-11-28 22:48:57,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57" (1/1) ... [2018-11-28 22:48:57,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57" (1/1) ... [2018-11-28 22:48:57,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:48:57,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:48:57,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:48:57,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:48:57,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57" (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 [2018-11-28 22:48:58,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:48:58,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:48:58,040 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-28 22:48:58,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:48:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 22:48:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:48:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:48:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:48:58,041 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:48:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:48:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:48:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:48:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:48:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:48:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:48:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:48:58,042 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:48:58,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:48:58,043 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:48:58,043 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:48:58,043 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:48:58,043 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:48:58,043 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:48:58,043 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:48:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:48:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:48:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:48:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:48:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:48:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:48:58,044 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:48:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:48:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:48:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:48:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:48:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:48:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:48:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:48:58,045 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:48:58,046 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:48:58,046 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:48:58,046 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:48:58,046 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:48:58,046 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:48:58,046 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:48:58,046 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:48:58,046 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:48:58,047 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:48:58,047 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:48:58,047 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:48:58,047 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:48:58,047 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:48:58,047 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:48:58,047 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:48:58,047 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:48:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:48:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:48:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:48:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:48:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:48:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:48:58,048 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:48:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:48:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:48:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:48:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:48:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:48:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:48:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:48:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 22:48:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:48:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:48:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:48:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:48:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:48:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:48:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:48:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:48:58,051 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:48:58,051 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:48:58,051 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:48:58,051 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:48:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:48:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:48:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:48:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:48:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:48:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:48:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:48:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:48:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:48:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:48:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:48:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:48:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:48:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:48:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:48:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:48:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:48:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:48:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:48:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:48:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:48:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:48:58,056 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:48:58,056 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:48:58,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:48:58,056 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-28 22:48:58,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 22:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 22:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 22:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:48:58,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:48:59,011 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:48:59,012 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 22:48:59,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:59 BoogieIcfgContainer [2018-11-28 22:48:59,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:48:59,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:48:59,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:48:59,017 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:48:59,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:48:57" (1/3) ... [2018-11-28 22:48:59,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7899d622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:48:59, skipping insertion in model container [2018-11-28 22:48:59,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:57" (2/3) ... [2018-11-28 22:48:59,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7899d622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:48:59, skipping insertion in model container [2018-11-28 22:48:59,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:59" (3/3) ... [2018-11-28 22:48:59,021 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 22:48:59,031 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:48:59,041 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-11-28 22:48:59,060 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-11-28 22:48:59,087 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:48:59,087 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:48:59,087 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:48:59,088 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:48:59,088 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:48:59,088 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:48:59,088 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:48:59,089 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:48:59,089 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:48:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2018-11-28 22:48:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 22:48:59,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:48:59,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:48:59,123 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:48:59,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:48:59,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1733579010, now seen corresponding path program 1 times [2018-11-28 22:48:59,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:48:59,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:48:59,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:48:59,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:48:59,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:48:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:48:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:48:59,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:48:59,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:48:59,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:48:59,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:48:59,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:48:59,514 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 5 states. [2018-11-28 22:49:00,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:00,681 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-11-28 22:49:00,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:49:00,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 22:49:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:00,695 INFO L225 Difference]: With dead ends: 120 [2018-11-28 22:49:00,695 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 22:49:00,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:49:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 22:49:00,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2018-11-28 22:49:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 22:49:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-11-28 22:49:00,745 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 9 [2018-11-28 22:49:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:00,745 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-11-28 22:49:00,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:49:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-11-28 22:49:00,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 22:49:00,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:00,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:00,747 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:00,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:00,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1733579011, now seen corresponding path program 1 times [2018-11-28 22:49:00,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:00,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:00,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:00,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:00,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:00,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:00,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:00,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:49:00,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:49:00,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:49:00,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:49:00,849 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 5 states. [2018-11-28 22:49:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:01,187 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-11-28 22:49:01,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:49:01,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 22:49:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:01,190 INFO L225 Difference]: With dead ends: 94 [2018-11-28 22:49:01,190 INFO L226 Difference]: Without dead ends: 94 [2018-11-28 22:49:01,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:49:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-28 22:49:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-11-28 22:49:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 22:49:01,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2018-11-28 22:49:01,202 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 9 [2018-11-28 22:49:01,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:01,202 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2018-11-28 22:49:01,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:49:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2018-11-28 22:49:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:49:01,203 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:01,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:01,204 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:01,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:01,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2093625574, now seen corresponding path program 1 times [2018-11-28 22:49:01,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:01,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:01,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:01,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:01,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:01,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:49:01,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:49:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:49:01,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:01,267 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 3 states. [2018-11-28 22:49:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:01,390 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2018-11-28 22:49:01,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:49:01,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:49:01,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:01,393 INFO L225 Difference]: With dead ends: 90 [2018-11-28 22:49:01,394 INFO L226 Difference]: Without dead ends: 90 [2018-11-28 22:49:01,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-28 22:49:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-28 22:49:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-28 22:49:01,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-11-28 22:49:01,403 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 10 [2018-11-28 22:49:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:01,405 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-11-28 22:49:01,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:49:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-11-28 22:49:01,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:49:01,406 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:01,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:01,406 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:01,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2093625575, now seen corresponding path program 1 times [2018-11-28 22:49:01,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:01,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:01,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:01,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:01,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:01,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:49:01,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:49:01,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:49:01,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:01,548 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 3 states. [2018-11-28 22:49:01,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:01,642 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-28 22:49:01,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:49:01,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:49:01,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:01,644 INFO L225 Difference]: With dead ends: 86 [2018-11-28 22:49:01,644 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 22:49:01,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 22:49:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-28 22:49:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 22:49:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2018-11-28 22:49:01,652 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 10 [2018-11-28 22:49:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:01,653 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2018-11-28 22:49:01,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:49:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2018-11-28 22:49:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:49:01,653 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:01,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:01,654 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:01,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:01,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1720338793, now seen corresponding path program 1 times [2018-11-28 22:49:01,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:01,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:01,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:01,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:01,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:01,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:01,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:49:01,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:49:01,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:49:01,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:49:01,877 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 8 states. [2018-11-28 22:49:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:02,236 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-11-28 22:49:02,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 22:49:02,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 22:49:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:02,241 INFO L225 Difference]: With dead ends: 97 [2018-11-28 22:49:02,241 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 22:49:02,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-28 22:49:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 22:49:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-11-28 22:49:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 22:49:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-28 22:49:02,253 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 15 [2018-11-28 22:49:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:02,254 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-28 22:49:02,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:49:02,254 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-28 22:49:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 22:49:02,255 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:02,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:02,255 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:02,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1791173131, now seen corresponding path program 1 times [2018-11-28 22:49:02,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:02,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:02,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:02,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:49:02,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:49:02,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:49:02,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:49:02,413 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 6 states. [2018-11-28 22:49:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:02,731 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-28 22:49:02,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:49:02,732 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-28 22:49:02,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:02,734 INFO L225 Difference]: With dead ends: 105 [2018-11-28 22:49:02,734 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 22:49:02,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:49:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 22:49:02,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-11-28 22:49:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 22:49:02,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-11-28 22:49:02,742 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 16 [2018-11-28 22:49:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:02,742 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-11-28 22:49:02,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:49:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-28 22:49:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 22:49:02,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:02,743 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:02,744 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:02,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:02,744 INFO L82 PathProgramCache]: Analyzing trace with hash -863246286, now seen corresponding path program 1 times [2018-11-28 22:49:02,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:02,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:02,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:02,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:02,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:49:02,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:49:02,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:49:02,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:49:02,880 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 7 states. [2018-11-28 22:49:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:03,148 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-11-28 22:49:03,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:49:03,149 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-28 22:49:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:03,151 INFO L225 Difference]: With dead ends: 101 [2018-11-28 22:49:03,151 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 22:49:03,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:49:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 22:49:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2018-11-28 22:49:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 22:49:03,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-11-28 22:49:03,158 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 25 [2018-11-28 22:49:03,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:03,160 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-11-28 22:49:03,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:49:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-11-28 22:49:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 22:49:03,162 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:03,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:03,162 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:03,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:03,163 INFO L82 PathProgramCache]: Analyzing trace with hash -863246285, now seen corresponding path program 1 times [2018-11-28 22:49:03,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:03,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:03,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:03,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:03,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:03,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:49:03,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:49:03,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:49:03,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:49:03,409 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-11-28 22:49:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:03,653 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2018-11-28 22:49:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:49:03,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-28 22:49:03,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:03,655 INFO L225 Difference]: With dead ends: 98 [2018-11-28 22:49:03,655 INFO L226 Difference]: Without dead ends: 98 [2018-11-28 22:49:03,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:49:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-28 22:49:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2018-11-28 22:49:03,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 22:49:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-11-28 22:49:03,662 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 25 [2018-11-28 22:49:03,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:03,662 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-11-28 22:49:03,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:49:03,662 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-11-28 22:49:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 22:49:03,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:03,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:03,664 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:03,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash -863258234, now seen corresponding path program 1 times [2018-11-28 22:49:03,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:03,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:03,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:03,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:03,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:49:03,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:49:03,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:49:03,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:03,732 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 3 states. [2018-11-28 22:49:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:03,864 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2018-11-28 22:49:03,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:49:03,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 22:49:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:03,866 INFO L225 Difference]: With dead ends: 72 [2018-11-28 22:49:03,866 INFO L226 Difference]: Without dead ends: 72 [2018-11-28 22:49:03,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-28 22:49:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-28 22:49:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-28 22:49:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-11-28 22:49:03,879 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 25 [2018-11-28 22:49:03,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:03,880 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-11-28 22:49:03,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:49:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-28 22:49:03,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 22:49:03,881 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:03,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:03,881 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:03,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:03,882 INFO L82 PathProgramCache]: Analyzing trace with hash -862144052, now seen corresponding path program 1 times [2018-11-28 22:49:03,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:03,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:03,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:03,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:03,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:03,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:03,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 22:49:03,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:49:03,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:49:03,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:03,958 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 3 states. [2018-11-28 22:49:04,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:04,004 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-28 22:49:04,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:49:04,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 22:49:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:04,005 INFO L225 Difference]: With dead ends: 69 [2018-11-28 22:49:04,006 INFO L226 Difference]: Without dead ends: 69 [2018-11-28 22:49:04,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-28 22:49:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-11-28 22:49:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 22:49:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-28 22:49:04,009 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 25 [2018-11-28 22:49:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:04,010 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-28 22:49:04,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:49:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-28 22:49:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 22:49:04,011 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:04,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:04,011 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:04,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash -862145304, now seen corresponding path program 1 times [2018-11-28 22:49:04,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:04,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:04,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:04,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:04,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:04,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:04,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:49:04,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:49:04,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:49:04,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:49:04,067 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 4 states. [2018-11-28 22:49:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:04,095 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-28 22:49:04,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:49:04,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-28 22:49:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:04,097 INFO L225 Difference]: With dead ends: 68 [2018-11-28 22:49:04,097 INFO L226 Difference]: Without dead ends: 68 [2018-11-28 22:49:04,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:49:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-28 22:49:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-11-28 22:49:04,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 22:49:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2018-11-28 22:49:04,101 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 25 [2018-11-28 22:49:04,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:04,101 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2018-11-28 22:49:04,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:49:04,102 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2018-11-28 22:49:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:49:04,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:04,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:04,103 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:04,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:04,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1294075165, now seen corresponding path program 1 times [2018-11-28 22:49:04,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:04,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:04,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:04,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:04,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:04,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:04,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:49:04,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 22:49:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 22:49:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:49:04,544 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 6 states. [2018-11-28 22:49:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:04,908 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-11-28 22:49:04,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:49:04,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-11-28 22:49:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:04,911 INFO L225 Difference]: With dead ends: 66 [2018-11-28 22:49:04,911 INFO L226 Difference]: Without dead ends: 66 [2018-11-28 22:49:04,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:49:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-28 22:49:04,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-28 22:49:04,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 22:49:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-28 22:49:04,915 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 28 [2018-11-28 22:49:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:04,915 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-28 22:49:04,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 22:49:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-28 22:49:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:49:04,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:04,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:04,917 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:04,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1461624531, now seen corresponding path program 1 times [2018-11-28 22:49:04,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:04,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:04,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:05,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:05,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:49:05,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:49:05,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:49:05,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:49:05,178 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 5 states. [2018-11-28 22:49:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:05,592 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-11-28 22:49:05,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 22:49:05,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-28 22:49:05,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:05,594 INFO L225 Difference]: With dead ends: 65 [2018-11-28 22:49:05,594 INFO L226 Difference]: Without dead ends: 65 [2018-11-28 22:49:05,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:49:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-28 22:49:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-28 22:49:05,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-28 22:49:05,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-11-28 22:49:05,598 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 29 [2018-11-28 22:49:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:05,598 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-11-28 22:49:05,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:49:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-11-28 22:49:05,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 22:49:05,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:05,599 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:05,600 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:05,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:05,600 INFO L82 PathProgramCache]: Analyzing trace with hash -98352470, now seen corresponding path program 1 times [2018-11-28 22:49:05,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:05,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:05,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:05,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:05,878 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-11-28 22:49:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:06,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:49:06,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:49:06,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:06,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:06,618 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:06,630 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:06,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:06,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:06,702 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:06,707 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:06,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:06,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:06,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:06,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-28 22:49:06,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:06,927 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 22:49:06,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:06,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:06,950 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:06,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 22:49:06,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:06,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:06,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-11-28 22:49:07,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 22:49:07,113 INFO L478 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 24 treesize of output 23 [2018-11-28 22:49:07,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:07,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:07,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-11-28 22:49:07,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 22:49:07,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:07,266 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:07,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:07,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-11-28 22:49:07,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-11-28 22:49:07,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-11-28 22:49:07,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:07,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:07,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 22:49:07,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 22:49:07,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:07,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 22:49:07,521 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:07,578 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 22:49:07,579 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:07,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:07,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:07,600 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-11-28 22:49:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:07,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:49:07,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-11-28 22:49:07,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:49:07,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:49:07,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2018-11-28 22:49:07,674 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 17 states. [2018-11-28 22:49:08,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:08,955 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-28 22:49:08,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 22:49:08,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-11-28 22:49:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:08,957 INFO L225 Difference]: With dead ends: 71 [2018-11-28 22:49:08,957 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 22:49:08,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2018-11-28 22:49:08,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 22:49:08,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-11-28 22:49:08,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 22:49:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-11-28 22:49:08,961 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2018-11-28 22:49:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:08,962 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-11-28 22:49:08,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:49:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-11-28 22:49:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 22:49:08,966 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:08,966 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:08,967 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:08,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:08,967 INFO L82 PathProgramCache]: Analyzing trace with hash -98352471, now seen corresponding path program 1 times [2018-11-28 22:49:08,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:08,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:08,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:08,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:08,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:09,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 22:49:09,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 22:49:09,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:09,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:09,337 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:09,340 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:09,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-28 22:49:09,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 22:49:09,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-28 22:49:09,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 22:49:09,554 INFO L478 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 26 treesize of output 25 [2018-11-28 22:49:09,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:09,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-11-28 22:49:09,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-28 22:49:09,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-11-28 22:49:09,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-11-28 22:49:09,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,680 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-11-28 22:49:09,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:09,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:09,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-28 22:49:09,703 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:09,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:49:09,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-11-28 22:49:09,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:49:09,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:49:09,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:49:09,725 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 17 states. [2018-11-28 22:49:10,462 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2018-11-28 22:49:10,933 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-11-28 22:49:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:11,811 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-28 22:49:11,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:49:11,812 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-11-28 22:49:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:11,813 INFO L225 Difference]: With dead ends: 70 [2018-11-28 22:49:11,813 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 22:49:11,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-11-28 22:49:11,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 22:49:11,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-11-28 22:49:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 22:49:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-11-28 22:49:11,818 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 30 [2018-11-28 22:49:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:11,818 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-11-28 22:49:11,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:49:11,819 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-11-28 22:49:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 22:49:11,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:11,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:11,822 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:11,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:11,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1934279712, now seen corresponding path program 1 times [2018-11-28 22:49:11,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:11,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:11,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:11,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:11,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:12,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:12,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:49:12,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:49:12,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:49:12,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:49:12,246 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2018-11-28 22:49:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:12,531 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-28 22:49:12,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:49:12,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-28 22:49:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:12,534 INFO L225 Difference]: With dead ends: 67 [2018-11-28 22:49:12,535 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 22:49:12,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:49:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 22:49:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-28 22:49:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 22:49:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-11-28 22:49:12,538 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 30 [2018-11-28 22:49:12,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:12,539 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-11-28 22:49:12,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:49:12,539 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-11-28 22:49:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 22:49:12,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:12,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:12,540 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:12,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:12,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1934279711, now seen corresponding path program 1 times [2018-11-28 22:49:12,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:12,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:12,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:12,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:12,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:12,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:12,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:49:12,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:49:12,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:49:12,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:12,618 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 3 states. [2018-11-28 22:49:12,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:12,672 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-28 22:49:12,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:49:12,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 22:49:12,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:12,674 INFO L225 Difference]: With dead ends: 63 [2018-11-28 22:49:12,674 INFO L226 Difference]: Without dead ends: 63 [2018-11-28 22:49:12,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-28 22:49:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-28 22:49:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-28 22:49:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-11-28 22:49:12,680 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 30 [2018-11-28 22:49:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:12,680 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-11-28 22:49:12,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:49:12,680 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-11-28 22:49:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 22:49:12,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:12,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:12,681 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:12,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:12,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1979694254, now seen corresponding path program 1 times [2018-11-28 22:49:12,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:12,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:12,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:12,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:12,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:12,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 22:49:12,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:49:12,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:49:12,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:49:12,783 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 5 states. [2018-11-28 22:49:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:12,823 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-11-28 22:49:12,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:49:12,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-28 22:49:12,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:12,826 INFO L225 Difference]: With dead ends: 79 [2018-11-28 22:49:12,826 INFO L226 Difference]: Without dead ends: 79 [2018-11-28 22:49:12,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:49:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-28 22:49:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-11-28 22:49:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-28 22:49:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2018-11-28 22:49:12,831 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 34 [2018-11-28 22:49:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:12,831 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2018-11-28 22:49:12,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:49:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2018-11-28 22:49:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 22:49:12,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:12,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:12,833 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2018-11-28 22:49:12,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1979693002, now seen corresponding path program 1 times [2018-11-28 22:49:12,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 22:49:12,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 22:49:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:12,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 22:49:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 22:49:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 22:49:12,887 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 22:49:12,907 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-28 22:49:12,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:49:12 BoogieIcfgContainer [2018-11-28 22:49:12,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:49:12,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:49:12,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:49:12,949 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:49:12,949 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:59" (3/4) ... [2018-11-28 22:49:12,957 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 22:49:12,958 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:49:12,959 INFO L168 Benchmark]: Toolchain (without parser) took 15779.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -144.2 MB). Peak memory consumption was 150.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:12,962 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:49:12,963 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:12,964 INFO L168 Benchmark]: Boogie Preprocessor took 97.39 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:12,964 INFO L168 Benchmark]: RCFGBuilder took 1039.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:12,970 INFO L168 Benchmark]: TraceAbstraction took 13931.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -46.7 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:12,973 INFO L168 Benchmark]: Witness Printer took 12.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:49:12,977 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 693.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.39 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1039.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13931.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -46.7 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. * Witness Printer took 12.63 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=12, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={11:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={11:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={13:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={10:0}, \old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={10:0}, plist={11:0}, plist={11:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={10:0}, \old(c)=0, c=1, item={13:0}, item->next={0:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={10:0}, plist={11:0}, plist={11:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={13:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={10:0}, plist={11:0}, plist={11:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={11:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={11:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={11:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={11:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={13:0}, c=1, length=1, list={11:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={11:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={11:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={11:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 93 locations, 41 error locations. UNSAFE Result, 13.8s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 7.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 944 SDtfs, 732 SDslu, 2145 SDs, 0 SdLazy, 2135 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 64 SyntacticMatches, 9 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 68 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 499 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 445 ConstructedInterpolants, 11 QuantifiedInterpolants, 80133 SizeOfPredicates, 35 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-91b1670 [2018-11-28 22:49:15,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 22:49:15,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 22:49:15,337 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 22:49:15,337 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 22:49:15,338 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 22:49:15,340 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 22:49:15,342 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 22:49:15,344 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 22:49:15,345 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 22:49:15,346 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 22:49:15,346 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 22:49:15,348 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 22:49:15,349 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 22:49:15,350 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 22:49:15,351 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 22:49:15,352 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 22:49:15,354 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 22:49:15,356 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 22:49:15,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 22:49:15,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 22:49:15,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 22:49:15,364 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 22:49:15,364 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 22:49:15,364 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 22:49:15,365 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 22:49:15,367 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 22:49:15,368 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 22:49:15,369 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 22:49:15,370 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 22:49:15,370 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 22:49:15,372 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 22:49:15,372 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 22:49:15,372 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 22:49:15,373 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 22:49:15,374 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 22:49:15,374 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2018-11-28 22:49:15,399 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 22:49:15,399 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 22:49:15,400 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 22:49:15,400 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 22:49:15,401 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 22:49:15,401 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 22:49:15,401 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 22:49:15,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 22:49:15,403 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 22:49:15,403 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 22:49:15,403 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 22:49:15,403 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 22:49:15,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 22:49:15,404 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 22:49:15,404 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 22:49:15,404 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 22:49:15,404 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 22:49:15,404 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 22:49:15,404 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 22:49:15,405 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 22:49:15,406 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 22:49:15,406 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 22:49:15,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 22:49:15,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 22:49:15,407 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 22:49:15,407 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 22:49:15,407 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 22:49:15,407 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 22:49:15,409 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 22:49:15,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 22:49:15,409 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 22:49:15,409 INFO L133 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 -> dd0b9292151174331f3cf63e5ad3d651d29dfbcc [2018-11-28 22:49:15,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 22:49:15,479 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 22:49:15,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 22:49:15,487 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 22:49:15,487 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 22:49:15,488 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 22:49:15,556 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ee30e55/05601b759c834c528fa358c579c456a4/FLAG650b1bd75 [2018-11-28 22:49:16,089 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 22:49:16,090 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 22:49:16,106 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ee30e55/05601b759c834c528fa358c579c456a4/FLAG650b1bd75 [2018-11-28 22:49:16,389 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ee30e55/05601b759c834c528fa358c579c456a4 [2018-11-28 22:49:16,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 22:49:16,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 22:49:16,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 22:49:16,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 22:49:16,403 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 22:49:16,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:49:16" (1/1) ... [2018-11-28 22:49:16,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12aeca62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:16, skipping insertion in model container [2018-11-28 22:49:16,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:49:16" (1/1) ... [2018-11-28 22:49:16,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 22:49:16,475 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 22:49:16,824 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:49:16,840 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 22:49:16,971 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 22:49:17,044 INFO L195 MainTranslator]: Completed translation [2018-11-28 22:49:17,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:17 WrapperNode [2018-11-28 22:49:17,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 22:49:17,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 22:49:17,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 22:49:17,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 22:49:17,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:17" (1/1) ... [2018-11-28 22:49:17,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:17" (1/1) ... [2018-11-28 22:49:17,076 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:17" (1/1) ... [2018-11-28 22:49:17,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:17" (1/1) ... [2018-11-28 22:49:17,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:17" (1/1) ... [2018-11-28 22:49:17,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:17" (1/1) ... [2018-11-28 22:49:17,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:17" (1/1) ... [2018-11-28 22:49:17,111 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 22:49:17,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 22:49:17,112 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 22:49:17,112 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 22:49:17,113 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:17" (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 [2018-11-28 22:49:17,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 22:49:17,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 22:49:17,170 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-28 22:49:17,170 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 22:49:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 22:49:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 22:49:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 22:49:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 22:49:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 22:49:17,171 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 22:49:17,172 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 22:49:17,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 22:49:17,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 22:49:17,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 22:49:17,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 22:49:17,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 22:49:17,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 22:49:17,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 22:49:17,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 22:49:17,174 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 22:49:17,174 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 22:49:17,174 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 22:49:17,174 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 22:49:17,174 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 22:49:17,175 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 22:49:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 22:49:17,176 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 22:49:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 22:49:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 22:49:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 22:49:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 22:49:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 22:49:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 22:49:17,177 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 22:49:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 22:49:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 22:49:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 22:49:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 22:49:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 22:49:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 22:49:17,178 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 22:49:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 22:49:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 22:49:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 22:49:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 22:49:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 22:49:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 22:49:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 22:49:17,179 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 22:49:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 22:49:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 22:49:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 22:49:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 22:49:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 22:49:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 22:49:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 22:49:17,180 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 22:49:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 22:49:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 22:49:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 22:49:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 22:49:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 22:49:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 22:49:17,181 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 22:49:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 22:49:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 22:49:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 22:49:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 22:49:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 22:49:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 22:49:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 22:49:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 22:49:17,182 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 22:49:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 22:49:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 22:49:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 22:49:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 22:49:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 22:49:17,184 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 22:49:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 22:49:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 22:49:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 22:49:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 22:49:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 22:49:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 22:49:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 22:49:17,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 22:49:17,186 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 22:49:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 22:49:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 22:49:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 22:49:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 22:49:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 22:49:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 22:49:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 22:49:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 22:49:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 22:49:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 22:49:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 22:49:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 22:49:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 22:49:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 22:49:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 22:49:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 22:49:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 22:49:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 22:49:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 22:49:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-28 22:49:17,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 22:49:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 22:49:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 22:49:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 22:49:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 22:49:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 22:49:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 22:49:17,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 22:49:18,187 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 22:49:18,187 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 22:49:18,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:49:18 BoogieIcfgContainer [2018-11-28 22:49:18,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 22:49:18,189 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 22:49:18,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 22:49:18,193 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 22:49:18,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:49:16" (1/3) ... [2018-11-28 22:49:18,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da18189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:49:18, skipping insertion in model container [2018-11-28 22:49:18,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:49:17" (2/3) ... [2018-11-28 22:49:18,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da18189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:49:18, skipping insertion in model container [2018-11-28 22:49:18,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:49:18" (3/3) ... [2018-11-28 22:49:18,197 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-11-28 22:49:18,206 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 22:49:18,213 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 41 error locations. [2018-11-28 22:49:18,229 INFO L257 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2018-11-28 22:49:18,258 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 22:49:18,259 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 22:49:18,259 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 22:49:18,259 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 22:49:18,260 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 22:49:18,260 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 22:49:18,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 22:49:18,261 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 22:49:18,261 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 22:49:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2018-11-28 22:49:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 22:49:18,293 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:18,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:18,298 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:18,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash 44321787, now seen corresponding path program 1 times [2018-11-28 22:49:18,310 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:18,311 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-11-28 22:49:18,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:18,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:18,477 INFO L478 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 [2018-11-28 22:49:18,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:18,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:18,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 22:49:18,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:18,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:18,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-28 22:49:18,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:18,744 INFO L267 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. [2018-11-28 22:49:18,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-11-28 22:49:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:18,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:18,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:18,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:49:18,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:49:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:49:18,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:49:18,925 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2018-11-28 22:49:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:20,139 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-28 22:49:20,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:49:20,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 22:49:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:20,151 INFO L225 Difference]: With dead ends: 88 [2018-11-28 22:49:20,151 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 22:49:20,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:49:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 22:49:20,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-28 22:49:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-28 22:49:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-11-28 22:49:20,198 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 9 [2018-11-28 22:49:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:20,199 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-11-28 22:49:20,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:49:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-28 22:49:20,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 22:49:20,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:20,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:20,201 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:20,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:20,202 INFO L82 PathProgramCache]: Analyzing trace with hash 44321788, now seen corresponding path program 1 times [2018-11-28 22:49:20,202 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:20,202 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-11-28 22:49:20,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:20,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:20,321 INFO L478 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 [2018-11-28 22:49:20,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:20,421 INFO L478 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 [2018-11-28 22:49:20,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:20,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:20,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-28 22:49:20,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:20,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:20,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 22:49:20,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:20,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:20,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:20,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-28 22:49:20,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:20,700 INFO L267 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. [2018-11-28 22:49:20,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2018-11-28 22:49:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:20,727 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:20,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:20,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:49:20,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 22:49:20,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 22:49:20,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 22:49:20,732 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 5 states. [2018-11-28 22:49:21,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:21,399 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-11-28 22:49:21,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 22:49:21,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 22:49:21,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:21,405 INFO L225 Difference]: With dead ends: 110 [2018-11-28 22:49:21,405 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 22:49:21,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 22:49:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 22:49:21,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2018-11-28 22:49:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 22:49:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-11-28 22:49:21,420 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 9 [2018-11-28 22:49:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:21,420 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-28 22:49:21,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 22:49:21,421 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2018-11-28 22:49:21,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:49:21,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:21,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:21,422 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:21,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:21,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1373975463, now seen corresponding path program 1 times [2018-11-28 22:49:21,423 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:21,423 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-11-28 22:49:21,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:21,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:21,514 INFO L478 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 [2018-11-28 22:49:21,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:21,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:21,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-28 22:49:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:21,557 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:21,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:21,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:49:21,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:49:21,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:49:21,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:21,560 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand 3 states. [2018-11-28 22:49:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:21,742 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2018-11-28 22:49:21,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:49:21,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:49:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:21,745 INFO L225 Difference]: With dead ends: 89 [2018-11-28 22:49:21,745 INFO L226 Difference]: Without dead ends: 89 [2018-11-28 22:49:21,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-28 22:49:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-28 22:49:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 22:49:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2018-11-28 22:49:21,755 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 10 [2018-11-28 22:49:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:21,756 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2018-11-28 22:49:21,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:49:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2018-11-28 22:49:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 22:49:21,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:21,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:21,757 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:21,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:21,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1373975464, now seen corresponding path program 1 times [2018-11-28 22:49:21,760 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:21,760 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-11-28 22:49:21,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:21,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:21,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:21,852 INFO L478 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 [2018-11-28 22:49:21,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:21,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:21,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 22:49:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:21,877 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:21,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:21,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:49:21,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:49:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:49:21,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:21,883 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 3 states. [2018-11-28 22:49:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:22,047 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-28 22:49:22,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:49:22,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 22:49:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:22,049 INFO L225 Difference]: With dead ends: 85 [2018-11-28 22:49:22,049 INFO L226 Difference]: Without dead ends: 85 [2018-11-28 22:49:22,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:22,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-28 22:49:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-28 22:49:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-28 22:49:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-11-28 22:49:22,058 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 10 [2018-11-28 22:49:22,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:22,058 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-28 22:49:22,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:49:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-28 22:49:22,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 22:49:22,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:22,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:22,060 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:22,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:22,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1028212614, now seen corresponding path program 1 times [2018-11-28 22:49:22,061 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:22,061 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-11-28 22:49:22,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:22,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:22,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 22:49:22,341 INFO L478 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 24 treesize of output 23 [2018-11-28 22:49:22,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 22:49:22,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-28 22:49:22,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,519 INFO L478 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 20 treesize of output 19 [2018-11-28 22:49:22,520 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:22,561 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2018-11-28 22:49:22,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 22:49:22,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 22:49:22,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 22:49:22,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,832 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 22:49:22,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 22:49:22,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 22:49:22,877 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 22:49:22,905 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,928 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 22:49:22,929 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,937 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:22,943 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2018-11-28 22:49:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:22,966 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:22,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:22,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:49:22,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:49:22,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:49:22,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=38, Unknown=5, NotChecked=0, Total=56 [2018-11-28 22:49:22,971 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 8 states. [2018-11-28 22:49:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:23,815 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-28 22:49:23,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 22:49:23,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 22:49:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:23,821 INFO L225 Difference]: With dead ends: 93 [2018-11-28 22:49:23,821 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 22:49:23,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=97, Unknown=13, NotChecked=0, Total=156 [2018-11-28 22:49:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 22:49:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-11-28 22:49:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 22:49:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2018-11-28 22:49:23,834 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 15 [2018-11-28 22:49:23,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:23,834 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2018-11-28 22:49:23,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:49:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2018-11-28 22:49:23,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 22:49:23,835 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:23,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:23,836 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:23,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1810098092, now seen corresponding path program 1 times [2018-11-28 22:49:23,839 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:23,839 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-11-28 22:49:23,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:23,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:24,108 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:24,125 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-28 22:49:24,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:24,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:24,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:24,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 22:49:24,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:24,203 INFO L267 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. [2018-11-28 22:49:24,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-11-28 22:49:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:24,235 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:24,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:24,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:49:24,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:49:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:49:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:49:24,241 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 7 states. [2018-11-28 22:49:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:24,960 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2018-11-28 22:49:24,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 22:49:24,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-28 22:49:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:24,963 INFO L225 Difference]: With dead ends: 93 [2018-11-28 22:49:24,963 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 22:49:24,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:49:24,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 22:49:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-28 22:49:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 22:49:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-28 22:49:24,974 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 16 [2018-11-28 22:49:24,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:24,975 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-28 22:49:24,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:49:24,975 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-28 22:49:24,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:49:24,976 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:24,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:24,977 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:24,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:24,977 INFO L82 PathProgramCache]: Analyzing trace with hash -659541597, now seen corresponding path program 1 times [2018-11-28 22:49:24,978 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:24,978 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-11-28 22:49:24,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:25,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:25,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:49:25,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:25,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:25,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 22:49:25,173 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:25,176 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:25,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:25,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:25,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:25,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 22:49:25,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 22:49:25,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 22:49:25,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:25,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:25,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:25,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-28 22:49:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:25,243 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:25,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:25,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:49:25,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:49:25,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:49:25,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:49:25,249 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 8 states. [2018-11-28 22:49:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:25,881 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-11-28 22:49:25,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:49:25,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-28 22:49:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:25,882 INFO L225 Difference]: With dead ends: 105 [2018-11-28 22:49:25,883 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 22:49:25,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-28 22:49:25,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 22:49:25,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2018-11-28 22:49:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-28 22:49:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2018-11-28 22:49:25,890 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 24 [2018-11-28 22:49:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:25,891 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2018-11-28 22:49:25,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:49:25,892 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2018-11-28 22:49:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:49:25,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:25,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:25,894 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:25,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:25,894 INFO L82 PathProgramCache]: Analyzing trace with hash -659541596, now seen corresponding path program 1 times [2018-11-28 22:49:25,894 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:25,894 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-11-28 22:49:25,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:26,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:26,091 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:26,095 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:26,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:26,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:26,122 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:26,128 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:26,128 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:26,132 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:26,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:26,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2018-11-28 22:49:26,197 INFO L478 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 11 [2018-11-28 22:49:26,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 22:49:26,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:26,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:26,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 22:49:26,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 22:49:26,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:26,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:26,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:26,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-28 22:49:26,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:26,265 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:26,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:26,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:49:26,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:49:26,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:49:26,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:49:26,270 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 8 states. [2018-11-28 22:49:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:26,891 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-11-28 22:49:26,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:49:26,892 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-28 22:49:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:26,893 INFO L225 Difference]: With dead ends: 102 [2018-11-28 22:49:26,893 INFO L226 Difference]: Without dead ends: 102 [2018-11-28 22:49:26,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:49:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-28 22:49:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2018-11-28 22:49:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-28 22:49:26,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2018-11-28 22:49:26,901 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 24 [2018-11-28 22:49:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:26,901 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2018-11-28 22:49:26,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:49:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2018-11-28 22:49:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 22:49:26,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:26,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:26,904 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:26,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash -659553545, now seen corresponding path program 1 times [2018-11-28 22:49:26,905 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:26,906 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-11-28 22:49:26,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:27,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:27,110 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:27,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:27,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 22:49:27,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 22:49:27,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 22:49:27,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:49:27,114 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 4 states. [2018-11-28 22:49:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:27,212 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-11-28 22:49:27,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 22:49:27,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-28 22:49:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:27,215 INFO L225 Difference]: With dead ends: 114 [2018-11-28 22:49:27,215 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 22:49:27,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 22:49:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 22:49:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2018-11-28 22:49:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 22:49:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2018-11-28 22:49:27,224 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 24 [2018-11-28 22:49:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:27,225 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2018-11-28 22:49:27,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 22:49:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2018-11-28 22:49:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 22:49:27,226 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:27,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:27,227 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:27,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:27,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1071674923, now seen corresponding path program 1 times [2018-11-28 22:49:27,229 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:27,229 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:49:27,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:27,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:27,383 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:27,388 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:27,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:27,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:27,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:27,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 22:49:27,422 INFO L478 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 11 [2018-11-28 22:49:27,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 22:49:27,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:27,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:27,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:27,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 22:49:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:27,537 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:27,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:27,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 22:49:27,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 22:49:27,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 22:49:27,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 22:49:27,540 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand 7 states. [2018-11-28 22:49:27,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:27,922 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2018-11-28 22:49:27,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:49:27,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-28 22:49:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:27,925 INFO L225 Difference]: With dead ends: 114 [2018-11-28 22:49:27,925 INFO L226 Difference]: Without dead ends: 114 [2018-11-28 22:49:27,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:49:27,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-28 22:49:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2018-11-28 22:49:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 22:49:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-11-28 22:49:27,932 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 27 [2018-11-28 22:49:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:27,932 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-11-28 22:49:27,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 22:49:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-11-28 22:49:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 22:49:27,933 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:27,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:27,935 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:27,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:27,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1137815676, now seen corresponding path program 1 times [2018-11-28 22:49:27,936 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:27,936 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:49:27,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:28,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:28,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:49:28,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:28,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:28,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 22:49:28,150 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:28,166 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:28,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:28,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:28,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:28,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 22:49:28,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 22:49:28,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 22:49:28,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:28,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:28,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:28,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-28 22:49:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:28,241 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:28,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:28,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 22:49:28,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 22:49:28,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 22:49:28,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 22:49:28,245 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 8 states. [2018-11-28 22:49:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:28,809 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2018-11-28 22:49:28,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 22:49:28,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-28 22:49:28,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:28,812 INFO L225 Difference]: With dead ends: 113 [2018-11-28 22:49:28,812 INFO L226 Difference]: Without dead ends: 113 [2018-11-28 22:49:28,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-28 22:49:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-28 22:49:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2018-11-28 22:49:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-28 22:49:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2018-11-28 22:49:28,817 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 28 [2018-11-28 22:49:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:28,818 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2018-11-28 22:49:28,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 22:49:28,819 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2018-11-28 22:49:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:49:28,819 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:28,820 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:28,821 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:28,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash 923379735, now seen corresponding path program 1 times [2018-11-28 22:49:28,821 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:28,822 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:49:28,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:28,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:29,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:49:29,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-11-28 22:49:29,065 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:29,068 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:29,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2018-11-28 22:49:29,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-28 22:49:29,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2018-11-28 22:49:29,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 22:49:29,257 INFO L478 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 28 treesize of output 27 [2018-11-28 22:49:29,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:29,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2018-11-28 22:49:29,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-11-28 22:49:29,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-28 22:49:29,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,472 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2018-11-28 22:49:29,473 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:29,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:29,489 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2018-11-28 22:49:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:29,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 22:49:29,889 INFO L478 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 11 treesize of output 9 [2018-11-28 22:49:29,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-28 22:49:29,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:29,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:29,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 22:49:29,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2018-11-28 22:49:30,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-28 22:49:30,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:30,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-11-28 22:49:30,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:30,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:49:30,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2018-11-28 22:49:30,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 10 treesize of output 3 [2018-11-28 22:49:30,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:30,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-28 22:49:30,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:30,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 22:49:30,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2018-11-28 22:49:30,128 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:30,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:49:30,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-11-28 22:49:30,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 22:49:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 22:49:30,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-28 22:49:30,132 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 17 states. [2018-11-28 22:49:31,038 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-11-28 22:49:31,933 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 22:49:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:32,816 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2018-11-28 22:49:32,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:49:32,818 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-11-28 22:49:32,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:32,820 INFO L225 Difference]: With dead ends: 117 [2018-11-28 22:49:32,820 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 22:49:32,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-11-28 22:49:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 22:49:32,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2018-11-28 22:49:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 22:49:32,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-11-28 22:49:32,824 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 29 [2018-11-28 22:49:32,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:32,824 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-11-28 22:49:32,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 22:49:32,825 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-11-28 22:49:32,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:49:32,827 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:32,827 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:32,828 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:32,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:32,828 INFO L82 PathProgramCache]: Analyzing trace with hash 923379736, now seen corresponding path program 1 times [2018-11-28 22:49:32,829 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:32,829 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:49:32,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:33,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:33,035 INFO L478 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 [2018-11-28 22:49:33,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,066 INFO L478 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 [2018-11-28 22:49:33,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-11-28 22:49:33,112 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:33,113 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-11-28 22:49:33,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:33,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:33,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 22:49:33,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,172 INFO L267 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. [2018-11-28 22:49:33,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2018-11-28 22:49:33,278 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:33,290 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:33,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,523 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:33,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 22:49:33,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:33,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:41 [2018-11-28 22:49:33,746 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:33,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 36 [2018-11-28 22:49:33,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:33,780 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:33,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 22:49:33,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:33,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:33,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:46 [2018-11-28 22:49:33,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 22:49:33,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-28 22:49:33,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,220 INFO L478 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 20 treesize of output 19 [2018-11-28 22:49:34,221 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 33 treesize of output 41 [2018-11-28 22:49:34,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 22:49:34,326 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,405 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:34,429 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2018-11-28 22:49:34,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 22:49:34,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 22:49:34,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,565 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 22:49:34,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-11-28 22:49:34,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-28 22:49:34,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 23 treesize of output 14 [2018-11-28 22:49:34,680 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-11-28 22:49:34,716 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:34,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:34,745 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2018-11-28 22:49:34,797 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:34,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 22:49:36,509 WARN L180 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2018-11-28 22:49:36,515 INFO L478 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 21 [2018-11-28 22:49:36,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 22:49:36,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:36,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:36,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 22:49:36,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 22:49:36,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:36,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:36,551 INFO L478 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 29 treesize of output 25 [2018-11-28 22:49:36,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-28 22:49:36,559 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:36,572 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:36,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-28 22:49:36,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 22:49:36,822 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:36,829 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:36,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-28 22:49:36,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 22:49:36,842 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:36,847 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:37,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-28 22:49:37,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-28 22:49:37,042 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:37,060 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:37,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-28 22:49:37,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-28 22:49:37,078 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:37,098 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:37,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-28 22:49:37,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-28 22:49:37,288 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:37,307 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:37,311 INFO L478 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 24 treesize of output 22 [2018-11-28 22:49:37,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-28 22:49:37,316 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:37,333 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 22:49:37,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 9 xjuncts. [2018-11-28 22:49:37,527 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2018-11-28 22:49:38,049 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2018-11-28 22:49:38,082 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:49:38,096 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:49:38,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 17 [2018-11-28 22:49:38,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:38,244 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:49:38,245 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:49:38,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-28 22:49:38,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:38,372 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:49:38,372 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:49:38,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-28 22:49:38,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:38,480 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:49:38,481 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:49:38,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 22:49:38,483 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:38,588 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:49:38,589 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 22:49:38,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-28 22:49:38,590 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:38,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-28 22:49:38,688 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:104, output treesize:47 [2018-11-28 22:49:39,049 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2018-11-28 22:49:39,347 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:39,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 22:49:39,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-11-28 22:49:39,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 22:49:39,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 22:49:39,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-11-28 22:49:39,359 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 21 states. [2018-11-28 22:49:40,574 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-11-28 22:49:40,953 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-11-28 22:49:41,178 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2018-11-28 22:49:41,720 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-28 22:49:42,137 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2018-11-28 22:49:44,584 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2018-11-28 22:49:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:50,370 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-11-28 22:49:50,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 22:49:50,372 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2018-11-28 22:49:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:50,373 INFO L225 Difference]: With dead ends: 119 [2018-11-28 22:49:50,373 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 22:49:50,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2018-11-28 22:49:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 22:49:50,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2018-11-28 22:49:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 22:49:50,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-11-28 22:49:50,378 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 29 [2018-11-28 22:49:50,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:50,379 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-11-28 22:49:50,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 22:49:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-11-28 22:49:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:49:50,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:50,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:50,383 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:50,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:50,384 INFO L82 PathProgramCache]: Analyzing trace with hash -912547506, now seen corresponding path program 1 times [2018-11-28 22:49:50,384 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:50,384 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:49:50,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:50,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:50,557 INFO L478 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 [2018-11-28 22:49:50,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 22:49:50,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 22:49:50,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2018-11-28 22:49:50,637 INFO L478 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 11 treesize of output 8 [2018-11-28 22:49:50,639 INFO L478 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 8 treesize of output 7 [2018-11-28 22:49:50,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-28 22:49:50,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:50,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:50,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-11-28 22:49:50,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-11-28 22:49:50,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 22:49:50,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 12 treesize of output 4 [2018-11-28 22:49:50,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-11-28 22:49:50,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 22:49:50,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 22:49:50,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 22:49:50,749 INFO L267 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. [2018-11-28 22:49:50,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 22:49:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:50,773 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:50,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:50,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 22:49:50,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 22:49:50,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 22:49:50,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-28 22:49:50,777 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 9 states. [2018-11-28 22:49:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:55,626 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-11-28 22:49:55,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 22:49:55,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-11-28 22:49:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:55,629 INFO L225 Difference]: With dead ends: 128 [2018-11-28 22:49:55,629 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 22:49:55,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-28 22:49:55,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 22:49:55,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 105. [2018-11-28 22:49:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-28 22:49:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2018-11-28 22:49:55,634 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 29 [2018-11-28 22:49:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:55,634 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2018-11-28 22:49:55,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 22:49:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-11-28 22:49:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 22:49:55,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:55,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:55,635 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:55,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash -912547505, now seen corresponding path program 1 times [2018-11-28 22:49:55,636 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:55,636 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:49:55,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 22:49:55,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 22:49:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 22:49:55,741 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 22:49:55,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 22:49:55,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 22:49:55,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 22:49:55,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 22:49:55,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:55,744 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 3 states. [2018-11-28 22:49:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 22:49:55,945 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2018-11-28 22:49:55,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 22:49:55,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 22:49:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 22:49:55,947 INFO L225 Difference]: With dead ends: 100 [2018-11-28 22:49:55,947 INFO L226 Difference]: Without dead ends: 100 [2018-11-28 22:49:55,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 22:49:55,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-28 22:49:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2018-11-28 22:49:55,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 22:49:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-11-28 22:49:55,953 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 29 [2018-11-28 22:49:55,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 22:49:55,954 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-11-28 22:49:55,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 22:49:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-11-28 22:49:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 22:49:55,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 22:49:55,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 22:49:55,958 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr14REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr26ENSURES_VIOLATIONMEMORY_LEAK, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-28 22:49:55,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 22:49:55,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1698250232, now seen corresponding path program 1 times [2018-11-28 22:49:55,958 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 22:49:55,958 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 22:49:55,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 22:49:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 22:49:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [MP cvc4 --incremental --print-success --lang smt --rewrite-divk (17)] Exception during sending of exit command (exit): Broken pipe [2018-11-28 22:49:56,519 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 22:49:56,541 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-11-28 22:49:56,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:49:56 BoogieIcfgContainer [2018-11-28 22:49:56,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 22:49:56,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 22:49:56,581 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 22:49:56,581 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 22:49:56,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:49:18" (3/4) ... [2018-11-28 22:49:56,590 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 22:49:56,591 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 22:49:56,592 INFO L168 Benchmark]: Toolchain (without parser) took 40198.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.7 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -87.1 MB). Peak memory consumption was 197.5 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:56,594 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:49:56,594 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -130.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:56,594 INFO L168 Benchmark]: Boogie Preprocessor took 65.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:49:56,595 INFO L168 Benchmark]: RCFGBuilder took 1076.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:56,595 INFO L168 Benchmark]: TraceAbstraction took 38391.44 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -17.0 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. [2018-11-28 22:49:56,595 INFO L168 Benchmark]: Witness Printer took 10.09 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 22:49:56,604 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 647.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -130.9 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.54 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1076.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.7 MB). Peak memory consumption was 60.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38391.44 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: -17.0 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. * Witness Printer took 10.09 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 635]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 635. Possible FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={-2139090935:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={-2139090935:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147479544:0}, \old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2147479544:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2147479544:0}, \old(c)=0, c=1, item={-2139090936:0}, item->next={0:0}, malloc(sizeof *item)={-2147479544:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={-2139090936:0}, malloc(sizeof *item)={-2147479544:0}, malloc(sizeof *item)={-2139090936:0}, plist={-2139090935:0}, plist={-2139090935:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={-2139090936:0}, c=1, length=1, list={-2139090935:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={-2139090935:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={-2139090935:0}, next={0:0}] [L658] return 0; [L637] struct item *list = ((void *)0); [L658] return 0; VAL [\old(c)=0, \result=0, c=1, length=0, next={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 41 error locations. UNSAFE Result, 38.3s OverallTime, 16 OverallIterations, 2 TraceHistogramMax, 24.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 790 SDtfs, 1101 SDslu, 2333 SDs, 0 SdLazy, 2877 SolverSat, 148 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 265 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 123 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 353 ConstructedInterpolants, 46 QuantifiedInterpolants, 110905 SizeOfPredicates, 119 NumberOfNonLiveVariables, 1581 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 8/28 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...