./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 0ed9222f 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-0ed9222-m [2019-01-13 22:42:06,180 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:42:06,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:42:06,194 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:42:06,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:42:06,195 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:42:06,197 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:42:06,199 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:42:06,200 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:42:06,201 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:42:06,202 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:42:06,202 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:42:06,204 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:42:06,205 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:42:06,206 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:42:06,207 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:42:06,208 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:42:06,214 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:42:06,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:42:06,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:42:06,223 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:42:06,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:42:06,230 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:42:06,232 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:42:06,232 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:42:06,236 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:42:06,237 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:42:06,238 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:42:06,239 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:42:06,242 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:42:06,242 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:42:06,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:42:06,243 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:42:06,243 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:42:06,244 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:42:06,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:42:06,245 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-13 22:42:06,260 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:42:06,260 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:42:06,262 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:42:06,262 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:42:06,262 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:42:06,262 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:42:06,262 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:42:06,262 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:42:06,263 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:42:06,264 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:42:06,264 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:42:06,264 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:42:06,264 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:42:06,264 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:42:06,265 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:42:06,265 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:42:06,266 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:42:06,266 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:42:06,266 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:42:06,266 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:42:06,266 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:42:06,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:42:06,267 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:42:06,267 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:42:06,267 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 22:42:06,267 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:42:06,267 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 [2019-01-13 22:42:06,316 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:42:06,334 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:42:06,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:42:06,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:42:06,343 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:42:06,344 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 [2019-01-13 22:42:06,404 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a22cb50/d85f6ed396b14b48bb179b358defce7a/FLAG3f8423d6d [2019-01-13 22:42:06,845 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:42:06,846 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2019-01-13 22:42:06,859 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a22cb50/d85f6ed396b14b48bb179b358defce7a/FLAG3f8423d6d [2019-01-13 22:42:07,222 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0a22cb50/d85f6ed396b14b48bb179b358defce7a [2019-01-13 22:42:07,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:42:07,226 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:42:07,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:42:07,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:42:07,231 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:42:07,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:42:07" (1/1) ... [2019-01-13 22:42:07,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e041531 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07, skipping insertion in model container [2019-01-13 22:42:07,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:42:07" (1/1) ... [2019-01-13 22:42:07,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:42:07,289 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:42:07,695 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:42:07,706 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:42:07,844 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:42:07,908 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:42:07,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07 WrapperNode [2019-01-13 22:42:07,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:42:07,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:42:07,910 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:42:07,911 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:42:07,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07" (1/1) ... [2019-01-13 22:42:07,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07" (1/1) ... [2019-01-13 22:42:07,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07" (1/1) ... [2019-01-13 22:42:07,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07" (1/1) ... [2019-01-13 22:42:07,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07" (1/1) ... [2019-01-13 22:42:07,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07" (1/1) ... [2019-01-13 22:42:07,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07" (1/1) ... [2019-01-13 22:42:08,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:42:08,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:42:08,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:42:08,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:42:08,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:42:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:42:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:42:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-13 22:42:08,069 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:42:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:42:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:42:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:42:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:42:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:42:08,070 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:42:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:42:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:42:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:42:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:42:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:42:08,071 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:42:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:42:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:42:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:42:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:42:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:42:08,072 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:42:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:42:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:42:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:42:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:42:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:42:08,073 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:42:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:42:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:42:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:42:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:42:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:42:08,074 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:42:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:42:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:42:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:42:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:42:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:42:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:42:08,075 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:42:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:42:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:42:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:42:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:42:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:42:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:42:08,076 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:42:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:42:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:42:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:42:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:42:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:42:08,077 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:42:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:42:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:42:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:42:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:42:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:42:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:42:08,078 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:42:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:42:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:42:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:42:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:42:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:42:08,079 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:42:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:42:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:42:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:42:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:42:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:42:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:42:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:42:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:42:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:42:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:42:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:42:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:42:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:42:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:42:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:42:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:42:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:42:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:42:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:42:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:42:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:42:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:42:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:42:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:42:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:42:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:42:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:42:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:42:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:42:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:42:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:42:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:42:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:42:08,085 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:42:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:42:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:42:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:42:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:42:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:42:08,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:42:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-13 22:42:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:42:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:42:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:42:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:42:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:42:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 22:42:08,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:42:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:42:08,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:42:08,998 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:42:08,998 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 22:42:09,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:42:08 BoogieIcfgContainer [2019-01-13 22:42:09,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:42:09,001 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:42:09,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:42:09,005 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:42:09,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:42:07" (1/3) ... [2019-01-13 22:42:09,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374b715d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:42:09, skipping insertion in model container [2019-01-13 22:42:09,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:07" (2/3) ... [2019-01-13 22:42:09,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374b715d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:42:09, skipping insertion in model container [2019-01-13 22:42:09,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:42:08" (3/3) ... [2019-01-13 22:42:09,009 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2019-01-13 22:42:09,019 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:42:09,028 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-01-13 22:42:09,044 INFO L257 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-01-13 22:42:09,070 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:42:09,071 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:42:09,071 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:42:09,071 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:42:09,071 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:42:09,071 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:42:09,072 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:42:09,072 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:42:09,072 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:42:09,091 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-01-13 22:42:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:42:09,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:09,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:09,105 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:09,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:09,111 INFO L82 PathProgramCache]: Analyzing trace with hash 483918089, now seen corresponding path program 1 times [2019-01-13 22:42:09,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:09,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:09,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:09,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:09,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:09,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:09,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:42:09,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:42:09,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:42:09,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:42:09,489 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 5 states. [2019-01-13 22:42:10,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:10,286 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2019-01-13 22:42:10,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:42:10,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:42:10,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:10,303 INFO L225 Difference]: With dead ends: 126 [2019-01-13 22:42:10,304 INFO L226 Difference]: Without dead ends: 123 [2019-01-13 22:42:10,305 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 [2019-01-13 22:42:10,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-13 22:42:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 102. [2019-01-13 22:42:10,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-13 22:42:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2019-01-13 22:42:10,354 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 9 [2019-01-13 22:42:10,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:10,354 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2019-01-13 22:42:10,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:42:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2019-01-13 22:42:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:42:10,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:10,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:10,356 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:10,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash 483918090, now seen corresponding path program 1 times [2019-01-13 22:42:10,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:10,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:10,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:10,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:10,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:10,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:10,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:42:10,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:42:10,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:42:10,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:42:10,497 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 5 states. [2019-01-13 22:42:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:10,778 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-13 22:42:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:42:10,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:42:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:10,784 INFO L225 Difference]: With dead ends: 101 [2019-01-13 22:42:10,784 INFO L226 Difference]: Without dead ends: 101 [2019-01-13 22:42:10,785 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 [2019-01-13 22:42:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-13 22:42:10,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2019-01-13 22:42:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-13 22:42:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2019-01-13 22:42:10,796 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 9 [2019-01-13 22:42:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:10,796 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2019-01-13 22:42:10,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:42:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2019-01-13 22:42:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:42:10,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:10,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:10,798 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:10,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2116558944, now seen corresponding path program 1 times [2019-01-13 22:42:10,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:10,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:10,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:10,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:10,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:10,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:42:10,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:42:10,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:42:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:42:10,871 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 3 states. [2019-01-13 22:42:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:11,011 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2019-01-13 22:42:11,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:42:11,012 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:42:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:11,014 INFO L225 Difference]: With dead ends: 93 [2019-01-13 22:42:11,014 INFO L226 Difference]: Without dead ends: 93 [2019-01-13 22:42:11,015 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 [2019-01-13 22:42:11,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-13 22:42:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-13 22:42:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-13 22:42:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2019-01-13 22:42:11,023 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 10 [2019-01-13 22:42:11,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:11,023 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2019-01-13 22:42:11,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:42:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2019-01-13 22:42:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:42:11,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:11,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:11,025 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash 2116558945, now seen corresponding path program 1 times [2019-01-13 22:42:11,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:11,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:11,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:11,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:11,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:11,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:11,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:42:11,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:42:11,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:42:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:42:11,079 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 3 states. [2019-01-13 22:42:11,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:11,202 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-01-13 22:42:11,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:42:11,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:42:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:11,204 INFO L225 Difference]: With dead ends: 89 [2019-01-13 22:42:11,204 INFO L226 Difference]: Without dead ends: 89 [2019-01-13 22:42:11,205 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 [2019-01-13 22:42:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-13 22:42:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-13 22:42:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-13 22:42:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2019-01-13 22:42:11,212 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 10 [2019-01-13 22:42:11,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:11,212 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2019-01-13 22:42:11,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:42:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2019-01-13 22:42:11,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:42:11,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:11,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:11,214 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:11,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:11,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1578128564, now seen corresponding path program 1 times [2019-01-13 22:42:11,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:11,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:11,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:11,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:11,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 22:42:11,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:42:11,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:42:11,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:42:11,424 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 8 states. [2019-01-13 22:42:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:11,758 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2019-01-13 22:42:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-13 22:42:11,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-13 22:42:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:11,762 INFO L225 Difference]: With dead ends: 100 [2019-01-13 22:42:11,762 INFO L226 Difference]: Without dead ends: 100 [2019-01-13 22:42:11,763 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 [2019-01-13 22:42:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-13 22:42:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2019-01-13 22:42:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-13 22:42:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2019-01-13 22:42:11,772 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 15 [2019-01-13 22:42:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:11,772 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2019-01-13 22:42:11,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:42:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2019-01-13 22:42:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:42:11,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:11,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:11,774 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:11,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1677623365, now seen corresponding path program 1 times [2019-01-13 22:42:11,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:11,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:11,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:11,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:11,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:11,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:11,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:42:11,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:42:11,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:42:11,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:42:11,939 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2019-01-13 22:42:12,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:12,402 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-01-13 22:42:12,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:42:12,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-01-13 22:42:12,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:12,405 INFO L225 Difference]: With dead ends: 95 [2019-01-13 22:42:12,405 INFO L226 Difference]: Without dead ends: 95 [2019-01-13 22:42:12,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:42:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-13 22:42:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-13 22:42:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-13 22:42:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2019-01-13 22:42:12,412 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 16 [2019-01-13 22:42:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:12,413 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2019-01-13 22:42:12,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:42:12,413 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2019-01-13 22:42:12,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-13 22:42:12,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:12,414 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] [2019-01-13 22:42:12,414 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:12,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:12,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1052744250, now seen corresponding path program 1 times [2019-01-13 22:42:12,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:12,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:12,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:12,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:12,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:12,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:12,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:42:12,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:42:12,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:42:12,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:42:12,539 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 7 states. [2019-01-13 22:42:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:12,820 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2019-01-13 22:42:12,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:42:12,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-13 22:42:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:12,823 INFO L225 Difference]: With dead ends: 108 [2019-01-13 22:42:12,823 INFO L226 Difference]: Without dead ends: 108 [2019-01-13 22:42:12,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:42:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-13 22:42:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2019-01-13 22:42:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-13 22:42:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-01-13 22:42:12,831 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 25 [2019-01-13 22:42:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:12,833 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-01-13 22:42:12,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:42:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-01-13 22:42:12,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-13 22:42:12,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:12,836 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] [2019-01-13 22:42:12,836 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:12,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:12,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1052744251, now seen corresponding path program 1 times [2019-01-13 22:42:12,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:12,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:12,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:12,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:12,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:13,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:13,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:42:13,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:42:13,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:42:13,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:42:13,067 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 7 states. [2019-01-13 22:42:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:13,284 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2019-01-13 22:42:13,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:42:13,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-01-13 22:42:13,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:13,286 INFO L225 Difference]: With dead ends: 102 [2019-01-13 22:42:13,287 INFO L226 Difference]: Without dead ends: 102 [2019-01-13 22:42:13,287 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 [2019-01-13 22:42:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-13 22:42:13,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. [2019-01-13 22:42:13,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-13 22:42:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2019-01-13 22:42:13,294 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 25 [2019-01-13 22:42:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:13,294 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2019-01-13 22:42:13,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:42:13,294 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2019-01-13 22:42:13,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-13 22:42:13,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:13,295 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] [2019-01-13 22:42:13,298 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:13,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:13,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1052730316, now seen corresponding path program 1 times [2019-01-13 22:42:13,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:13,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:13,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:13,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:13,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:13,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:13,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-13 22:42:13,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:42:13,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:42:13,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:42:13,353 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand 3 states. [2019-01-13 22:42:13,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:13,370 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-01-13 22:42:13,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:42:13,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-01-13 22:42:13,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:13,372 INFO L225 Difference]: With dead ends: 74 [2019-01-13 22:42:13,372 INFO L226 Difference]: Without dead ends: 74 [2019-01-13 22:42:13,372 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 [2019-01-13 22:42:13,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-13 22:42:13,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-13 22:42:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-13 22:42:13,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-01-13 22:42:13,377 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2019-01-13 22:42:13,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:13,377 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-01-13 22:42:13,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:42:13,377 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-01-13 22:42:13,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-13 22:42:13,378 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:13,378 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] [2019-01-13 22:42:13,378 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:13,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:13,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1053966446, now seen corresponding path program 1 times [2019-01-13 22:42:13,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:13,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:13,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:13,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:13,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:13,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:13,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:42:13,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 22:42:13,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 22:42:13,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:42:13,470 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 4 states. [2019-01-13 22:42:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:13,523 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-13 22:42:13,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 22:42:13,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-01-13 22:42:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:13,526 INFO L225 Difference]: With dead ends: 70 [2019-01-13 22:42:13,526 INFO L226 Difference]: Without dead ends: 70 [2019-01-13 22:42:13,526 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 [2019-01-13 22:42:13,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-13 22:42:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-01-13 22:42:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-13 22:42:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2019-01-13 22:42:13,530 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 25 [2019-01-13 22:42:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:13,530 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2019-01-13 22:42:13,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 22:42:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2019-01-13 22:42:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 22:42:13,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:13,531 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] [2019-01-13 22:42:13,532 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:13,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:13,532 INFO L82 PathProgramCache]: Analyzing trace with hash 452771287, now seen corresponding path program 1 times [2019-01-13 22:42:13,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:13,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:13,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:13,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:13,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:13,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:13,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:42:13,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:42:13,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:42:13,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:42:13,773 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 6 states. [2019-01-13 22:42:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:13,950 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-01-13 22:42:13,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:42:13,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-13 22:42:13,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:13,955 INFO L225 Difference]: With dead ends: 68 [2019-01-13 22:42:13,955 INFO L226 Difference]: Without dead ends: 68 [2019-01-13 22:42:13,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:42:13,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-13 22:42:13,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-13 22:42:13,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-13 22:42:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-01-13 22:42:13,961 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 28 [2019-01-13 22:42:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:13,961 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-01-13 22:42:13,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:42:13,961 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-01-13 22:42:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:42:13,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:13,962 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] [2019-01-13 22:42:13,963 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:13,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1151008091, now seen corresponding path program 1 times [2019-01-13 22:42:13,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:13,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:13,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:13,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:13,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:14,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:14,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 22:42:14,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 22:42:14,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 22:42:14,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:42:14,345 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 6 states. [2019-01-13 22:42:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:14,544 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-13 22:42:14,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:42:14,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-01-13 22:42:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:14,547 INFO L225 Difference]: With dead ends: 67 [2019-01-13 22:42:14,547 INFO L226 Difference]: Without dead ends: 67 [2019-01-13 22:42:14,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:42:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-13 22:42:14,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-13 22:42:14,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-13 22:42:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2019-01-13 22:42:14,551 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 29 [2019-01-13 22:42:14,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:14,551 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2019-01-13 22:42:14,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 22:42:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2019-01-13 22:42:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:42:14,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:14,552 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] [2019-01-13 22:42:14,553 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:14,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:14,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1342664407, now seen corresponding path program 1 times [2019-01-13 22:42:14,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:14,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:14,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:14,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:14,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:14,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:14,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:42:14,868 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 [2019-01-13 22:42:14,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:14,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:15,245 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 [2019-01-13 22:42:15,249 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 [2019-01-13 22:42:15,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:15,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:15,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:15,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-01-13 22:42:15,454 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 [2019-01-13 22:42:15,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:15,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:15,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-01-13 22:42:15,632 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 [2019-01-13 22:42:15,640 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 [2019-01-13 22:42:15,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:15,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:15,709 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. [2019-01-13 22:42:15,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-01-13 22:42:15,761 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 [2019-01-13 22:42:15,797 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 [2019-01-13 22:42:15,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:15,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:15,812 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. [2019-01-13 22:42:15,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2019-01-13 22:42:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:15,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:42:15,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2019-01-13 22:42:15,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:42:15,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:42:15,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-01-13 22:42:15,858 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand 17 states. [2019-01-13 22:42:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:16,993 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2019-01-13 22:42:16,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:42:16,994 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-13 22:42:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:16,995 INFO L225 Difference]: With dead ends: 73 [2019-01-13 22:42:16,996 INFO L226 Difference]: Without dead ends: 73 [2019-01-13 22:42:16,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-01-13 22:42:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-13 22:42:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2019-01-13 22:42:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-13 22:42:17,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-01-13 22:42:17,002 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 30 [2019-01-13 22:42:17,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:17,002 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-01-13 22:42:17,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:42:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-01-13 22:42:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:42:17,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:17,003 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] [2019-01-13 22:42:17,007 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:17,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:17,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1342664406, now seen corresponding path program 1 times [2019-01-13 22:42:17,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:17,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:17,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:17,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:17,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-13 22:42:17,321 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 [2019-01-13 22:42:17,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:17,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:17,459 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 [2019-01-13 22:42:17,462 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 [2019-01-13 22:42:17,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,482 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 [2019-01-13 22:42:17,492 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 [2019-01-13 22:42:17,492 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2019-01-13 22:42:17,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:17,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:17,582 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 [2019-01-13 22:42:17,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,648 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 [2019-01-13 22:42:17,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2019-01-13 22:42:17,851 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 [2019-01-13 22:42:17,858 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 [2019-01-13 22:42:17,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,935 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 [2019-01-13 22:42:17,948 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2019-01-13 22:42:17,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,977 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 30 treesize of output 29 [2019-01-13 22:42:17,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:17,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:18,009 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. [2019-01-13 22:42:18,010 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2019-01-13 22:42:18,061 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 [2019-01-13 22:42:18,078 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 30 treesize of output 23 [2019-01-13 22:42:18,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:18,103 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 [2019-01-13 22:42:18,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:18,145 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 [2019-01-13 22:42:18,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:18,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:18,177 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 [2019-01-13 22:42:18,182 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 [2019-01-13 22:42:18,182 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:18,191 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:18,200 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. [2019-01-13 22:42:18,200 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2019-01-13 22:42:18,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:18,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:42:18,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2019-01-13 22:42:18,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:42:18,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:42:18,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2019-01-13 22:42:18,244 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 17 states. [2019-01-13 22:42:18,794 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-01-13 22:42:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:19,750 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-13 22:42:19,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-13 22:42:19,751 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-13 22:42:19,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:19,753 INFO L225 Difference]: With dead ends: 72 [2019-01-13 22:42:19,753 INFO L226 Difference]: Without dead ends: 72 [2019-01-13 22:42:19,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2019-01-13 22:42:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-13 22:42:19,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-01-13 22:42:19,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-13 22:42:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-13 22:42:19,758 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 30 [2019-01-13 22:42:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:19,758 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-13 22:42:19,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:42:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-13 22:42:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:42:19,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:19,760 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] [2019-01-13 22:42:19,763 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:19,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:19,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1321512537, now seen corresponding path program 1 times [2019-01-13 22:42:19,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:19,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:19,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:19,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:19,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:19,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:19,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:42:19,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:42:19,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:42:19,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:42:19,996 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 5 states. [2019-01-13 22:42:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:20,445 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2019-01-13 22:42:20,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 22:42:20,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-13 22:42:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:20,448 INFO L225 Difference]: With dead ends: 69 [2019-01-13 22:42:20,448 INFO L226 Difference]: Without dead ends: 69 [2019-01-13 22:42:20,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:42:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-13 22:42:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-13 22:42:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-13 22:42:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-01-13 22:42:20,453 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 30 [2019-01-13 22:42:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:20,453 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-01-13 22:42:20,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:42:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-01-13 22:42:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 22:42:20,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:20,457 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] [2019-01-13 22:42:20,457 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:20,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:20,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1982784226, now seen corresponding path program 1 times [2019-01-13 22:42:20,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:20,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:20,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:20,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:20,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:20,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:20,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:42:20,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:42:20,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:42:20,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:42:20,637 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 8 states. [2019-01-13 22:42:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:20,845 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-13 22:42:20,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:42:20,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-01-13 22:42:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:20,847 INFO L225 Difference]: With dead ends: 66 [2019-01-13 22:42:20,848 INFO L226 Difference]: Without dead ends: 66 [2019-01-13 22:42:20,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-01-13 22:42:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-13 22:42:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-13 22:42:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-13 22:42:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-13 22:42:20,853 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 31 [2019-01-13 22:42:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:20,853 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-13 22:42:20,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:42:20,853 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-13 22:42:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-13 22:42:20,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:20,854 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, 1] [2019-01-13 22:42:20,857 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr20REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr10REQUIRES_VIOLATION, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION]=== [2019-01-13 22:42:20,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:20,858 INFO L82 PathProgramCache]: Analyzing trace with hash -743527608, now seen corresponding path program 1 times [2019-01-13 22:42:20,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 22:42:20,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 22:42:20,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:20,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:20,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 22:42:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:42:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:42:20,955 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:42:20,976 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 22:42:20,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:42:20 BoogieIcfgContainer [2019-01-13 22:42:20,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:42:20,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:42:20,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:42:20,998 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:42:20,998 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:42:08" (3/4) ... [2019-01-13 22:42:21,004 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 22:42:21,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:42:21,005 INFO L168 Benchmark]: Toolchain (without parser) took 13779.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -129.2 MB). Peak memory consumption was 150.8 MB. Max. memory is 11.5 GB. [2019-01-13 22:42:21,006 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. [2019-01-13 22:42:21,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-13 22:42:21,007 INFO L168 Benchmark]: Boogie Preprocessor took 92.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:42:21,008 INFO L168 Benchmark]: RCFGBuilder took 997.41 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: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. [2019-01-13 22:42:21,009 INFO L168 Benchmark]: TraceAbstraction took 11996.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.9 MB). Peak memory consumption was 122.0 MB. Max. memory is 11.5 GB. [2019-01-13 22:42:21,012 INFO L168 Benchmark]: Witness Printer took 6.83 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. [2019-01-13 22:42:21,017 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 681.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -187.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.57 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 997.41 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: 57.7 MB). Peak memory consumption was 57.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11996.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 126.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.9 MB). Peak memory consumption was 122.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.83 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)=10, c=0] [L637] struct item *list = ((void *)0); [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={-1:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={-1:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={1:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1: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)={2:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={2:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={2:0}, \old(c)=0, c=1, item={1:0}, item->next={0:0}, malloc(sizeof *item)={2:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={1:0}, malloc(sizeof *item)={2:0}, malloc(sizeof *item)={1:0}, plist={-1:0}, plist={-1:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={-1:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={-1:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={-1:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={-1:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={1:0}, c=1, length=1, list={-1:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={-1:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={-1:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={-1: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, 99 locations, 44 error locations. UNSAFE Result, 11.9s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 6.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 868 SDtfs, 813 SDslu, 2338 SDs, 0 SdLazy, 2147 SolverSat, 104 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred 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, 16 MinimizatonAttempts, 64 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 389 ConstructedInterpolants, 11 QuantifiedInterpolants, 81202 SizeOfPredicates, 35 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 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-0ed9222-m [2019-01-13 22:42:23,200 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 22:42:23,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 22:42:23,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 22:42:23,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 22:42:23,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 22:42:23,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 22:42:23,219 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 22:42:23,220 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 22:42:23,221 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 22:42:23,222 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 22:42:23,223 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 22:42:23,223 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 22:42:23,224 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 22:42:23,226 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 22:42:23,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 22:42:23,228 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 22:42:23,230 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 22:42:23,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 22:42:23,233 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 22:42:23,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 22:42:23,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 22:42:23,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 22:42:23,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 22:42:23,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 22:42:23,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 22:42:23,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 22:42:23,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 22:42:23,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 22:42:23,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 22:42:23,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 22:42:23,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 22:42:23,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 22:42:23,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 22:42:23,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 22:42:23,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 22:42:23,249 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-01-13 22:42:23,263 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 22:42:23,264 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 22:42:23,265 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 22:42:23,265 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 22:42:23,265 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 22:42:23,266 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 22:42:23,266 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 22:42:23,266 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-13 22:42:23,266 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 22:42:23,266 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 22:42:23,267 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 22:42:23,267 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-13 22:42:23,267 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-13 22:42:23,267 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-13 22:42:23,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 22:42:23,267 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-13 22:42:23,268 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-13 22:42:23,269 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 22:42:23,269 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 22:42:23,270 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 22:42:23,270 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 22:42:23,270 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 22:42:23,271 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 22:42:23,271 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:42:23,271 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 22:42:23,271 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 22:42:23,271 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-13 22:42:23,271 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 22:42:23,272 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-13 22:42:23,272 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 [2019-01-13 22:42:23,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 22:42:23,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 22:42:23,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 22:42:23,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 22:42:23,351 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 22:42:23,352 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 [2019-01-13 22:42:23,409 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886b1a768/86ae0a007c324a3c9543834ab39fac69/FLAG617566e89 [2019-01-13 22:42:23,916 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 22:42:23,917 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2019-01-13 22:42:23,934 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886b1a768/86ae0a007c324a3c9543834ab39fac69/FLAG617566e89 [2019-01-13 22:42:24,179 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/886b1a768/86ae0a007c324a3c9543834ab39fac69 [2019-01-13 22:42:24,184 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 22:42:24,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-13 22:42:24,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 22:42:24,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 22:42:24,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 22:42:24,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:42:24" (1/1) ... [2019-01-13 22:42:24,198 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e38a7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24, skipping insertion in model container [2019-01-13 22:42:24,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 10:42:24" (1/1) ... [2019-01-13 22:42:24,206 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 22:42:24,253 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 22:42:24,666 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:42:24,687 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 22:42:24,842 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 22:42:24,893 INFO L195 MainTranslator]: Completed translation [2019-01-13 22:42:24,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24 WrapperNode [2019-01-13 22:42:24,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 22:42:24,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 22:42:24,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 22:42:24,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 22:42:24,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24" (1/1) ... [2019-01-13 22:42:24,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24" (1/1) ... [2019-01-13 22:42:24,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24" (1/1) ... [2019-01-13 22:42:24,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24" (1/1) ... [2019-01-13 22:42:24,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24" (1/1) ... [2019-01-13 22:42:24,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24" (1/1) ... [2019-01-13 22:42:24,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24" (1/1) ... [2019-01-13 22:42:24,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 22:42:24,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 22:42:24,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 22:42:24,978 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 22:42:24,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 22:42:25,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-13 22:42:25,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 22:42:25,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:42:25,044 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-01-13 22:42:25,044 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-13 22:42:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-13 22:42:25,044 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-13 22:42:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-13 22:42:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-13 22:42:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-13 22:42:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-13 22:42:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-13 22:42:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-13 22:42:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-13 22:42:25,045 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-13 22:42:25,046 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-13 22:42:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-13 22:42:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-13 22:42:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-13 22:42:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-13 22:42:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-13 22:42:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-13 22:42:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-13 22:42:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-13 22:42:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-13 22:42:25,049 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-13 22:42:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-13 22:42:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-13 22:42:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-13 22:42:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-13 22:42:25,050 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-13 22:42:25,051 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-13 22:42:25,051 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-13 22:42:25,051 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-13 22:42:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-13 22:42:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-13 22:42:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-13 22:42:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-13 22:42:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-13 22:42:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-13 22:42:25,052 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-13 22:42:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-13 22:42:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-13 22:42:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-13 22:42:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-13 22:42:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-13 22:42:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-13 22:42:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-13 22:42:25,053 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-13 22:42:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-13 22:42:25,055 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-13 22:42:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-13 22:42:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-13 22:42:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-13 22:42:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-13 22:42:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-13 22:42:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-13 22:42:25,056 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-13 22:42:25,057 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-13 22:42:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-13 22:42:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-13 22:42:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-13 22:42:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-13 22:42:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-13 22:42:25,058 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-13 22:42:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-13 22:42:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-13 22:42:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-13 22:42:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-13 22:42:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-13 22:42:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-13 22:42:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-13 22:42:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-13 22:42:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-13 22:42:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-13 22:42:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-13 22:42:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-13 22:42:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-13 22:42:25,061 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-13 22:42:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-13 22:42:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-13 22:42:25,063 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-13 22:42:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-13 22:42:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-13 22:42:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-13 22:42:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-13 22:42:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-13 22:42:25,064 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-13 22:42:25,065 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-13 22:42:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-13 22:42:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-13 22:42:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-13 22:42:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-13 22:42:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-13 22:42:25,066 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-13 22:42:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-13 22:42:25,067 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-13 22:42:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-13 22:42:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-13 22:42:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-13 22:42:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-13 22:42:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-13 22:42:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-13 22:42:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-13 22:42:25,068 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-13 22:42:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-13 22:42:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-13 22:42:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-13 22:42:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-01-13 22:42:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-13 22:42:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-13 22:42:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-13 22:42:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-13 22:42:25,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 22:42:25,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-13 22:42:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 22:42:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-13 22:42:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 22:42:25,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-01-13 22:42:26,136 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 22:42:26,136 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-13 22:42:26,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:42:26 BoogieIcfgContainer [2019-01-13 22:42:26,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 22:42:26,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 22:42:26,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 22:42:26,142 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 22:42:26,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 10:42:24" (1/3) ... [2019-01-13 22:42:26,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c38392d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:42:26, skipping insertion in model container [2019-01-13 22:42:26,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 10:42:24" (2/3) ... [2019-01-13 22:42:26,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c38392d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 10:42:26, skipping insertion in model container [2019-01-13 22:42:26,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:42:26" (3/3) ... [2019-01-13 22:42:26,147 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2019-01-13 22:42:26,157 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 22:42:26,166 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2019-01-13 22:42:26,183 INFO L257 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2019-01-13 22:42:26,209 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 22:42:26,210 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 22:42:26,210 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-13 22:42:26,211 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 22:42:26,211 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 22:42:26,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 22:42:26,212 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 22:42:26,212 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 22:42:26,212 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 22:42:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-01-13 22:42:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:42:26,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:26,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:26,246 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:26,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:26,252 INFO L82 PathProgramCache]: Analyzing trace with hash -361014642, now seen corresponding path program 1 times [2019-01-13 22:42:26,258 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:26,258 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 [2019-01-13 22:42:26,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:26,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:26,440 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 [2019-01-13 22:42:26,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 22:42:26,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:26,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:26,550 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 [2019-01-13 22:42:26,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:26,677 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. [2019-01-13 22:42:26,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2019-01-13 22:42:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:26,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:26,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:26,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:42:26,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:42:26,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:42:26,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:42:26,865 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 5 states. [2019-01-13 22:42:28,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:28,123 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2019-01-13 22:42:28,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:42:28,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:42:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:28,142 INFO L225 Difference]: With dead ends: 94 [2019-01-13 22:42:28,142 INFO L226 Difference]: Without dead ends: 91 [2019-01-13 22:42:28,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-13 22:42:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-13 22:42:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-01-13 22:42:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-13 22:42:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2019-01-13 22:42:28,192 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 9 [2019-01-13 22:42:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:28,193 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2019-01-13 22:42:28,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:42:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2019-01-13 22:42:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-13 22:42:28,193 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:28,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:28,194 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:28,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:28,195 INFO L82 PathProgramCache]: Analyzing trace with hash -361014641, now seen corresponding path program 1 times [2019-01-13 22:42:28,197 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:28,197 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 [2019-01-13 22:42:28,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:28,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:28,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 6 treesize of output 5 [2019-01-13 22:42:28,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:28,306 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 [2019-01-13 22:42:28,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:28,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:28,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-01-13 22:42:28,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:28,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:28,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, 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 [2019-01-13 22:42:28,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:28,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:28,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:28,473 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 [2019-01-13 22:42:28,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:28,491 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. [2019-01-13 22:42:28,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-01-13 22:42:28,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:28,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:28,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:28,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:42:28,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 22:42:28,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 22:42:28,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-13 22:42:28,527 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand 5 states. [2019-01-13 22:42:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:29,312 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2019-01-13 22:42:29,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 22:42:29,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-13 22:42:29,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:29,317 INFO L225 Difference]: With dead ends: 120 [2019-01-13 22:42:29,318 INFO L226 Difference]: Without dead ends: 120 [2019-01-13 22:42:29,318 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 [2019-01-13 22:42:29,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-13 22:42:29,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2019-01-13 22:42:29,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-13 22:42:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2019-01-13 22:42:29,330 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 9 [2019-01-13 22:42:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:29,330 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2019-01-13 22:42:29,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 22:42:29,331 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2019-01-13 22:42:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:42:29,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:29,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:29,332 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:29,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1693448065, now seen corresponding path program 1 times [2019-01-13 22:42:29,333 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:29,335 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 [2019-01-13 22:42:29,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:29,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:29,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 [2019-01-13 22:42:29,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-01-13 22:42:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:29,467 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:29,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:29,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:42:29,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:42:29,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:42:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:42:29,470 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 3 states. [2019-01-13 22:42:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:29,612 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2019-01-13 22:42:29,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:42:29,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:42:29,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:29,614 INFO L225 Difference]: With dead ends: 95 [2019-01-13 22:42:29,614 INFO L226 Difference]: Without dead ends: 95 [2019-01-13 22:42:29,614 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 [2019-01-13 22:42:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-13 22:42:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-13 22:42:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-13 22:42:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2019-01-13 22:42:29,624 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 10 [2019-01-13 22:42:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:29,625 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2019-01-13 22:42:29,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:42:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2019-01-13 22:42:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-13 22:42:29,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:29,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:29,626 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:29,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1693448066, now seen corresponding path program 1 times [2019-01-13 22:42:29,629 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:29,629 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 [2019-01-13 22:42:29,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:29,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:29,745 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 [2019-01-13 22:42:29,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:29,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:42:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:29,839 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:29,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:29,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:42:29,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:42:29,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:42:29,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:42:29,844 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 3 states. [2019-01-13 22:42:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:29,993 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2019-01-13 22:42:29,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:42:29,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-01-13 22:42:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:29,995 INFO L225 Difference]: With dead ends: 91 [2019-01-13 22:42:29,996 INFO L226 Difference]: Without dead ends: 91 [2019-01-13 22:42:29,996 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 [2019-01-13 22:42:29,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-13 22:42:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-13 22:42:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-13 22:42:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-01-13 22:42:30,004 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2019-01-13 22:42:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:30,005 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-01-13 22:42:30,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:42:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-01-13 22:42:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-13 22:42:30,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:30,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:30,007 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:30,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:30,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1237440327, now seen corresponding path program 1 times [2019-01-13 22:42:30,008 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:30,009 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 [2019-01-13 22:42:30,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:30,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:30,287 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 [2019-01-13 22:42:30,306 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 [2019-01-13 22:42:30,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,422 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 [2019-01-13 22:42:30,431 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 [2019-01-13 22:42:30,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,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 20 treesize of output 19 [2019-01-13 22:42:30,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,514 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. [2019-01-13 22:42:30,514 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:45, output treesize:37 [2019-01-13 22:42:30,728 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 [2019-01-13 22:42:30,734 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 [2019-01-13 22:42:30,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,766 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 [2019-01-13 22:42:30,767 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,795 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 [2019-01-13 22:42:30,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,852 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 [2019-01-13 22:42:30,857 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 [2019-01-13 22:42:30,858 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,886 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 [2019-01-13 22:42:30,887 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,909 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 [2019-01-13 22:42:30,910 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,917 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:30,923 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:51, output treesize:7 [2019-01-13 22:42:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:30,946 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:30,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:30,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 22:42:30,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:42:30,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:42:30,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=39, Unknown=4, NotChecked=0, Total=56 [2019-01-13 22:42:30,952 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 8 states. [2019-01-13 22:42:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:31,810 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-01-13 22:42:31,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-13 22:42:31,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-13 22:42:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:31,813 INFO L225 Difference]: With dead ends: 99 [2019-01-13 22:42:31,813 INFO L226 Difference]: Without dead ends: 99 [2019-01-13 22:42:31,814 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=98, Unknown=12, NotChecked=0, Total=156 [2019-01-13 22:42:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-13 22:42:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-01-13 22:42:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-13 22:42:31,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-01-13 22:42:31,824 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 15 [2019-01-13 22:42:31,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:31,825 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-01-13 22:42:31,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:42:31,825 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-01-13 22:42:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-13 22:42:31,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:31,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-13 22:42:31,827 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:31,827 INFO L82 PathProgramCache]: Analyzing trace with hash 294333670, now seen corresponding path program 1 times [2019-01-13 22:42:31,828 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:31,828 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 [2019-01-13 22:42:31,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:31,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:32,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:32,104 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 [2019-01-13 22:42:32,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:32,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:32,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:32,159 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 [2019-01-13 22:42:32,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:32,173 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. [2019-01-13 22:42:32,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2019-01-13 22:42:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:32,204 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:32,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:32,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:42:32,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:42:32,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:42:32,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:42:32,216 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 7 states. [2019-01-13 22:42:32,414 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-13 22:42:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:32,769 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2019-01-13 22:42:32,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 22:42:32,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-01-13 22:42:32,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:32,772 INFO L225 Difference]: With dead ends: 99 [2019-01-13 22:42:32,772 INFO L226 Difference]: Without dead ends: 99 [2019-01-13 22:42:32,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:42:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-13 22:42:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-13 22:42:32,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-13 22:42:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2019-01-13 22:42:32,784 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 16 [2019-01-13 22:42:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:32,785 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2019-01-13 22:42:32,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:42:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2019-01-13 22:42:32,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 22:42:32,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:32,787 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] [2019-01-13 22:42:32,787 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:32,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:32,788 INFO L82 PathProgramCache]: Analyzing trace with hash -212963565, now seen corresponding path program 1 times [2019-01-13 22:42:32,788 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:32,788 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 [2019-01-13 22:42:32,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:32,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:33,037 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:33,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:33,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 22:42:33,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 22:42:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 22:42:33,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:42:33,042 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 4 states. [2019-01-13 22:42:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:33,190 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2019-01-13 22:42:33,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-13 22:42:33,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-01-13 22:42:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:33,193 INFO L225 Difference]: With dead ends: 125 [2019-01-13 22:42:33,193 INFO L226 Difference]: Without dead ends: 125 [2019-01-13 22:42:33,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 22:42:33,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-13 22:42:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2019-01-13 22:42:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-13 22:42:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2019-01-13 22:42:33,205 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 24 [2019-01-13 22:42:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:33,205 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2019-01-13 22:42:33,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 22:42:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2019-01-13 22:42:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 22:42:33,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:33,207 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] [2019-01-13 22:42:33,208 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:33,208 INFO L82 PathProgramCache]: Analyzing trace with hash -214185761, now seen corresponding path program 1 times [2019-01-13 22:42:33,208 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:33,208 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 [2019-01-13 22:42:33,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:33,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:33,330 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 [2019-01-13 22:42:33,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:33,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:33,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-13 22:42:33,366 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 [2019-01-13 22:42:33,369 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 [2019-01-13 22:42:33,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:33,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:33,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:33,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-13 22:42:33,433 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 [2019-01-13 22:42:33,436 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 [2019-01-13 22:42:33,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:33,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:33,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:33,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-01-13 22:42:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:33,455 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:33,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:33,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:42:33,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:42:33,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:42:33,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:42:33,461 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 8 states. [2019-01-13 22:42:33,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:33,996 INFO L93 Difference]: Finished difference Result 129 states and 142 transitions. [2019-01-13 22:42:33,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:42:33,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-01-13 22:42:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:33,999 INFO L225 Difference]: With dead ends: 129 [2019-01-13 22:42:33,999 INFO L226 Difference]: Without dead ends: 129 [2019-01-13 22:42:34,000 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 [2019-01-13 22:42:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-13 22:42:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2019-01-13 22:42:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-13 22:42:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2019-01-13 22:42:34,006 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 24 [2019-01-13 22:42:34,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:34,006 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2019-01-13 22:42:34,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:42:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2019-01-13 22:42:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-13 22:42:34,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:34,008 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] [2019-01-13 22:42:34,008 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:34,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:34,010 INFO L82 PathProgramCache]: Analyzing trace with hash -214185760, now seen corresponding path program 1 times [2019-01-13 22:42:34,010 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:34,010 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 [2019-01-13 22:42:34,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:34,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:34,202 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 [2019-01-13 22:42:34,207 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 [2019-01-13 22:42:34,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,232 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 [2019-01-13 22:42:34,238 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 [2019-01-13 22:42:34,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,256 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:28, output treesize:17 [2019-01-13 22:42:34,308 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 [2019-01-13 22:42:34,311 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 [2019-01-13 22:42:34,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,334 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 [2019-01-13 22:42:34,337 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 [2019-01-13 22:42:34,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:34,348 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-01-13 22:42:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:34,379 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:34,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:34,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:42:34,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:42:34,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:42:34,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:42:34,383 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 8 states. [2019-01-13 22:42:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:35,070 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2019-01-13 22:42:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:42:35,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-01-13 22:42:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:35,072 INFO L225 Difference]: With dead ends: 124 [2019-01-13 22:42:35,072 INFO L226 Difference]: Without dead ends: 124 [2019-01-13 22:42:35,072 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 [2019-01-13 22:42:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-13 22:42:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2019-01-13 22:42:35,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-13 22:42:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2019-01-13 22:42:35,077 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 24 [2019-01-13 22:42:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:35,078 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2019-01-13 22:42:35,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:42:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2019-01-13 22:42:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-13 22:42:35,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:35,079 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] [2019-01-13 22:42:35,080 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:35,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:35,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1513416792, now seen corresponding path program 1 times [2019-01-13 22:42:35,082 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:35,082 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 [2019-01-13 22:42:35,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:35,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:35,245 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 [2019-01-13 22:42:35,252 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 [2019-01-13 22:42:35,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-01-13 22:42:35,290 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 [2019-01-13 22:42:35,306 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 [2019-01-13 22:42:35,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-13 22:42:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:35,435 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:35,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:35,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:42:35,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:42:35,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:42:35,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:42:35,438 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand 7 states. [2019-01-13 22:42:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:35,760 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-01-13 22:42:35,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:42:35,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-13 22:42:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:35,763 INFO L225 Difference]: With dead ends: 123 [2019-01-13 22:42:35,763 INFO L226 Difference]: Without dead ends: 123 [2019-01-13 22:42:35,763 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 [2019-01-13 22:42:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-13 22:42:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 111. [2019-01-13 22:42:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-13 22:42:35,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2019-01-13 22:42:35,770 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 27 [2019-01-13 22:42:35,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:35,770 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2019-01-13 22:42:35,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:42:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2019-01-13 22:42:35,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-13 22:42:35,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:35,773 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] [2019-01-13 22:42:35,775 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:35,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:35,776 INFO L82 PathProgramCache]: Analyzing trace with hash -328719616, now seen corresponding path program 1 times [2019-01-13 22:42:35,777 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:35,777 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 [2019-01-13 22:42:35,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:35,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:35,964 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 [2019-01-13 22:42:35,968 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 [2019-01-13 22:42:35,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:35,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-01-13 22:42:36,029 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 [2019-01-13 22:42:36,033 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 [2019-01-13 22:42:36,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:36,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:36,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:36,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-01-13 22:42:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:36,057 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:36,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:36,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 22:42:36,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 22:42:36,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 22:42:36,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-13 22:42:36,060 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 7 states. [2019-01-13 22:42:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:36,587 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-01-13 22:42:36,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:42:36,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-01-13 22:42:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:36,589 INFO L225 Difference]: With dead ends: 122 [2019-01-13 22:42:36,589 INFO L226 Difference]: Without dead ends: 122 [2019-01-13 22:42:36,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:42:36,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-13 22:42:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2019-01-13 22:42:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-13 22:42:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2019-01-13 22:42:36,593 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 28 [2019-01-13 22:42:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:36,593 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2019-01-13 22:42:36,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 22:42:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2019-01-13 22:42:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:42:36,596 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:36,596 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] [2019-01-13 22:42:36,597 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 30416938, now seen corresponding path program 1 times [2019-01-13 22:42:36,597 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:36,597 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 [2019-01-13 22:42:36,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:36,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:36,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 5 treesize of output 1 [2019-01-13 22:42:36,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:36,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:36,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-13 22:42:36,832 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 [2019-01-13 22:42:36,836 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 [2019-01-13 22:42:36,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:36,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:36,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:36,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-13 22:42:36,896 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 [2019-01-13 22:42:36,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:36,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:36,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-01-13 22:42:37,017 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 [2019-01-13 22:42:37,026 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 [2019-01-13 22:42:37,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:37,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:37,086 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. [2019-01-13 22:42:37,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:28 [2019-01-13 22:42:37,155 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 [2019-01-13 22:42:37,162 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 [2019-01-13 22:42:37,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:37,190 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 [2019-01-13 22:42:37,191 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:37,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:37,203 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. [2019-01-13 22:42:37,203 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:13 [2019-01-13 22:42:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:37,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:42:37,615 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 [2019-01-13 22:42:37,618 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 [2019-01-13 22:42:37,619 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:42:37,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:42:37,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-13 22:42:37,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:50 [2019-01-13 22:42:37,752 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 [2019-01-13 22:42:37,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:37,777 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 [2019-01-13 22:42:37,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:37,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:42:37,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:7 [2019-01-13 22:42:37,804 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 [2019-01-13 22:42:37,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:37,806 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 [2019-01-13 22:42:37,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:37,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-13 22:42:37,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:7 [2019-01-13 22:42:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:37,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:42:37,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-01-13 22:42:37,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-13 22:42:37,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-13 22:42:37,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-01-13 22:42:37,823 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 17 states. [2019-01-13 22:42:39,219 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-01-13 22:42:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:40,729 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2019-01-13 22:42:40,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:42:40,731 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2019-01-13 22:42:40,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:40,732 INFO L225 Difference]: With dead ends: 127 [2019-01-13 22:42:40,732 INFO L226 Difference]: Without dead ends: 127 [2019-01-13 22:42:40,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2019-01-13 22:42:40,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-13 22:42:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2019-01-13 22:42:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-13 22:42:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-01-13 22:42:40,737 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 29 [2019-01-13 22:42:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:40,737 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-01-13 22:42:40,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-13 22:42:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-01-13 22:42:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:42:40,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:40,738 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] [2019-01-13 22:42:40,738 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 30416939, now seen corresponding path program 1 times [2019-01-13 22:42:40,742 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:40,742 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 [2019-01-13 22:42:40,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:40,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:40,945 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 [2019-01-13 22:42:40,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:40,970 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 [2019-01-13 22:42:40,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:40,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:40,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2019-01-13 22:42:41,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:41,018 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 [2019-01-13 22:42:41,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:41,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:41,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:41,054 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 [2019-01-13 22:42:41,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:41,220 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. [2019-01-13 22:42:41,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:24 [2019-01-13 22:42:41,344 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 [2019-01-13 22:42:41,358 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 [2019-01-13 22:42:41,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:41,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:41,602 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 [2019-01-13 22:42:41,617 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 [2019-01-13 22:42:41,617 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:41,644 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:41,824 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. [2019-01-13 22:42:41,824 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:41 [2019-01-13 22:42:42,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:42,017 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 [2019-01-13 22:42:42,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:42,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:42,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:42,057 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 [2019-01-13 22:42:42,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:42,081 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. [2019-01-13 22:42:42,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:46 [2019-01-13 22:42:42,251 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 [2019-01-13 22:42:42,260 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 [2019-01-13 22:42:42,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:42,318 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 [2019-01-13 22:42:42,319 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:42,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:42,500 INFO L303 Elim1Store]: Index analysis took 136 ms [2019-01-13 22:42:42,607 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 [2019-01-13 22:42:42,616 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 [2019-01-13 22:42:42,617 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:42,691 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:42,713 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. [2019-01-13 22:42:42,713 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:62, output treesize:54 [2019-01-13 22:42:42,845 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 [2019-01-13 22:42:42,850 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 [2019-01-13 22:42:42,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:42,884 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 [2019-01-13 22:42:42,885 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:42,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:43,013 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 [2019-01-13 22:42:43,019 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 [2019-01-13 22:42:43,019 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:43,061 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 [2019-01-13 22:42:43,062 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:43,096 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 [2019-01-13 22:42:43,097 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:43,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:43,122 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. [2019-01-13 22:42:43,122 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:68, output treesize:20 [2019-01-13 22:42:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:43,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-13 22:42:44,890 WARN L181 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-01-13 22:42:44,897 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 [2019-01-13 22:42:44,901 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 [2019-01-13 22:42:44,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:44,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:44,921 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 [2019-01-13 22:42:44,925 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 [2019-01-13 22:42:44,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:44,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:44,946 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 [2019-01-13 22:42:44,951 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 [2019-01-13 22:42:44,956 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:44,965 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:45,229 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 [2019-01-13 22:42:45,231 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 [2019-01-13 22:42:45,233 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:45,238 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:45,242 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 [2019-01-13 22:42:45,246 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 [2019-01-13 22:42:45,248 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:45,253 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:45,421 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 [2019-01-13 22:42:45,426 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 [2019-01-13 22:42:45,426 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:42:45,444 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:42:45,448 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 [2019-01-13 22:42:45,451 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 [2019-01-13 22:42:45,452 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:42:45,474 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:42:45,656 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 [2019-01-13 22:42:45,660 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 [2019-01-13 22:42:45,661 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:42:45,679 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:42:45,683 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 [2019-01-13 22:42:45,687 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 [2019-01-13 22:42:45,688 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:42:45,706 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-13 22:42:45,896 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. [2019-01-13 22:42:45,897 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 7 variables, input treesize:104, output treesize:132 [2019-01-13 22:42:46,380 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2019-01-13 22:42:46,412 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:42:46,417 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:42:46,418 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 [2019-01-13 22:42:46,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:46,636 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:42:46,637 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:42:46,638 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 [2019-01-13 22:42:46,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:46,763 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:42:46,763 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:42:46,764 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 [2019-01-13 22:42:46,764 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:46,873 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:42:46,874 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:42:46,875 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 [2019-01-13 22:42:46,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:46,975 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:42:46,976 INFO L683 Elim1Store]: detected equality via solver [2019-01-13 22:42:46,977 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 [2019-01-13 22:42:46,977 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:47,073 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. [2019-01-13 22:42:47,074 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 12 variables, input treesize:104, output treesize:47 [2019-01-13 22:42:47,431 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2019-01-13 22:42:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:47,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-13 22:42:47,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2019-01-13 22:42:47,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-13 22:42:47,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-13 22:42:47,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-01-13 22:42:47,715 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 21 states. [2019-01-13 22:42:48,891 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-01-13 22:42:49,248 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2019-01-13 22:42:49,459 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 44 [2019-01-13 22:42:49,855 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2019-01-13 22:42:52,659 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-01-13 22:42:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:58,284 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2019-01-13 22:42:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-13 22:42:58,286 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 29 [2019-01-13 22:42:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:58,287 INFO L225 Difference]: With dead ends: 129 [2019-01-13 22:42:58,287 INFO L226 Difference]: Without dead ends: 129 [2019-01-13 22:42:58,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2019-01-13 22:42:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-13 22:42:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2019-01-13 22:42:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-13 22:42:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-01-13 22:42:58,292 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 29 [2019-01-13 22:42:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:58,292 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-01-13 22:42:58,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-13 22:42:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-01-13 22:42:58,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 22:42:58,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:58,293 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] [2019-01-13 22:42:58,294 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:58,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:58,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1600373414, now seen corresponding path program 1 times [2019-01-13 22:42:58,294 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:58,294 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 [2019-01-13 22:42:58,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:58,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:58,459 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 [2019-01-13 22:42:58,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-01-13 22:42:58,500 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 [2019-01-13 22:42:58,502 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 [2019-01-13 22:42:58,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-13 22:42:58,541 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 [2019-01-13 22:42:58,543 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 [2019-01-13 22:42:58,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:58,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-01-13 22:42:58,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:58,558 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:58,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:58,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 22:42:58,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-13 22:42:58,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-13 22:42:58,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-13 22:42:58,561 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 8 states. [2019-01-13 22:42:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:42:59,097 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2019-01-13 22:42:59,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-13 22:42:59,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-01-13 22:42:59,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:42:59,100 INFO L225 Difference]: With dead ends: 120 [2019-01-13 22:42:59,100 INFO L226 Difference]: Without dead ends: 120 [2019-01-13 22:42:59,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-13 22:42:59,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-13 22:42:59,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2019-01-13 22:42:59,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-13 22:42:59,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-01-13 22:42:59,105 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 29 [2019-01-13 22:42:59,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:42:59,105 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-01-13 22:42:59,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-13 22:42:59,105 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-01-13 22:42:59,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:42:59,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:42:59,108 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] [2019-01-13 22:42:59,109 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:42:59,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:42:59,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1928031811, now seen corresponding path program 1 times [2019-01-13 22:42:59,109 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:42:59,109 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 [2019-01-13 22:42:59,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:42:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:42:59,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:42:59,260 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 [2019-01-13 22:42:59,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-13 22:42:59,310 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 [2019-01-13 22:42:59,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2019-01-13 22:42:59,329 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 [2019-01-13 22:42:59,331 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 [2019-01-13 22:42:59,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2019-01-13 22:42:59,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:59,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:59,367 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 [2019-01-13 22:42:59,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-13 22:42:59,399 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 [2019-01-13 22:42:59,402 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 [2019-01-13 22:42:59,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2019-01-13 22:42:59,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-13 22:42:59,430 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 [2019-01-13 22:42:59,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-13 22:42:59,438 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. [2019-01-13 22:42:59,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-01-13 22:42:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:42:59,461 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:42:59,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:42:59,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-13 22:42:59,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-13 22:42:59,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-13 22:42:59,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-01-13 22:42:59,464 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 9 states. [2019-01-13 22:43:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:43:04,312 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2019-01-13 22:43:04,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 22:43:04,313 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-01-13 22:43:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:43:04,315 INFO L225 Difference]: With dead ends: 139 [2019-01-13 22:43:04,315 INFO L226 Difference]: Without dead ends: 139 [2019-01-13 22:43:04,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-13 22:43:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-13 22:43:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2019-01-13 22:43:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-13 22:43:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2019-01-13 22:43:04,321 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 30 [2019-01-13 22:43:04,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:43:04,321 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2019-01-13 22:43:04,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-13 22:43:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2019-01-13 22:43:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 22:43:04,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:43:04,323 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] [2019-01-13 22:43:04,327 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:43:04,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:43:04,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1928031812, now seen corresponding path program 1 times [2019-01-13 22:43:04,328 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:43:04,328 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 [2019-01-13 22:43:04,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:43:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 22:43:04,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-13 22:43:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 22:43:04,458 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-13 22:43:04,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 22:43:04,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-13 22:43:04,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-13 22:43:04,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-13 22:43:04,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:43:04,468 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 3 states. [2019-01-13 22:43:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 22:43:04,672 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-01-13 22:43:04,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-13 22:43:04,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-01-13 22:43:04,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 22:43:04,675 INFO L225 Difference]: With dead ends: 107 [2019-01-13 22:43:04,675 INFO L226 Difference]: Without dead ends: 107 [2019-01-13 22:43:04,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-13 22:43:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-13 22:43:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2019-01-13 22:43:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-13 22:43:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2019-01-13 22:43:04,679 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 30 [2019-01-13 22:43:04,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 22:43:04,679 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2019-01-13 22:43:04,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-13 22:43:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2019-01-13 22:43:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-13 22:43:04,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 22:43:04,680 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] [2019-01-13 22:43:04,681 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr28REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr29ENSURES_VIOLATIONMEMORY_LEAK, mainErr25ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr24ASSERT_VIOLATIONMEMORY_FREE, appendErr11REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION]=== [2019-01-13 22:43:04,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 22:43:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash 390378349, now seen corresponding path program 1 times [2019-01-13 22:43:04,681 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2019-01-13 22:43:04,681 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-01-13 22:43:04,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 22:43:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:43:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-13 22:43:05,104 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-13 22:43:05,138 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-01-13 22:43:05,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 10:43:05 BoogieIcfgContainer [2019-01-13 22:43:05,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 22:43:05,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 22:43:05,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 22:43:05,187 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 22:43:05,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 10:42:26" (3/4) ... [2019-01-13 22:43:05,199 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-13 22:43:05,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 22:43:05,200 INFO L168 Benchmark]: Toolchain (without parser) took 41015.38 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 943.3 MB in the beginning and 988.3 MB in the end (delta: -45.0 MB). Peak memory consumption was 279.5 MB. Max. memory is 11.5 GB. [2019-01-13 22:43:05,200 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:43:05,201 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-13 22:43:05,203 INFO L168 Benchmark]: Boogie Preprocessor took 83.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:43:05,203 INFO L168 Benchmark]: RCFGBuilder took 1160.16 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: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2019-01-13 22:43:05,204 INFO L168 Benchmark]: TraceAbstraction took 39047.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 988.3 MB in the end (delta: 72.0 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. [2019-01-13 22:43:05,206 INFO L168 Benchmark]: Witness Printer took 11.91 ms. Allocated memory is still 1.4 GB. Free memory is still 988.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 22:43:05,209 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 706.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1160.16 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: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39047.82 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 988.3 MB in the end (delta: 72.0 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. * Witness Printer took 11.91 ms. Allocated memory is still 1.4 GB. Free memory is still 988.3 MB. 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={-2147483647:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={-2147483647:0}] [L627] c++ [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={-1216889031:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L629] EXPR \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-1216889031:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L629] item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={-1216889031:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L630] EXPR item->next VAL [\old(c)=0, c=1, item={-1216889031:0}, item->next={0:0}, malloc(sizeof *item)={-1216889031:0}, plist={-2147483647:0}, plist={-2147483647: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)={-2113929216:0}, \old(c)=0, c=1, item={-1216889031:0}, item->next={0:0}, malloc(sizeof *item)={-1216889031:0}, malloc(sizeof *item)={-2113929216:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L630-L632] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={-2113929216:0}, \old(c)=0, c=1, item={-1216889031:0}, item->next={0:0}, malloc(sizeof *item)={-1216889031:0}, malloc(sizeof *item)={-2113929216:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L633] *plist = item VAL [\old(c)=0, c=1, item={-1216889031:0}, malloc(sizeof *item)={-1216889031:0}, malloc(sizeof *item)={-2113929216:0}, plist={-2147483647:0}, plist={-2147483647:0}] [L640] RET append(&list) VAL [\old(c)=0, c=1, length=0, list={-2147483647:0}] [L641] length++ VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}] [L642] COND FALSE !(__VERIFIER_nondet_int() && c < 20) [L643] COND TRUE length > 0 VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}] [L644] COND FALSE !(length < 0) VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}] [L647] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-1216889031:0}, c=1, length=1, list={-2147483647:0}] [L647] EXPR list->next VAL [\old(c)=0, \read(*list)={-1216889031:0}, c=1, length=1, list={-2147483647:0}, list->next={0:0}] [L647] struct item *next = list->next; [L648] EXPR \read(*list) VAL [\old(c)=0, \read(*list)={-1216889031:0}, c=1, length=1, list={-2147483647:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={-1216889031:0}, c=1, length=1, list={-2147483647:0}, next={0:0}] [L648] free(list) VAL [\old(c)=0, \read(*list)={-1216889031:0}, c=1, length=1, list={-2147483647:0}, next={0:0}] [L648] free(list) [L649] list = next VAL [\old(c)=0, c=1, length=1, list={-2147483647:0}, next={0:0}] [L650] length-- VAL [\old(c)=0, c=1, length=0, list={-2147483647:0}, next={0:0}] [L652] COND FALSE !(length > 0) VAL [\old(c)=0, c=1, length=0, list={-2147483647: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 5 procedures, 101 locations, 44 error locations. UNSAFE Result, 38.9s OverallTime, 17 OverallIterations, 2 TraceHistogramMax, 25.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 927 SDtfs, 1403 SDslu, 2925 SDs, 0 SdLazy, 3185 SolverSat, 148 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 290 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=7, 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, 16 MinimizatonAttempts, 168 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 383 ConstructedInterpolants, 46 QuantifiedInterpolants, 117797 SizeOfPredicates, 126 NumberOfNonLiveVariables, 1800 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 18 InterpolantComputations, 14 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...