./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0232_false-valid-free.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0232_false-valid-free.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer --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 1197d671a588cd166018a116686924380f8bf0f7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 10:48:29,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:48:29,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:48:29,314 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:48:29,314 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:48:29,315 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:48:29,316 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:48:29,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:48:29,318 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:48:29,319 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:48:29,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:48:29,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:48:29,320 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:48:29,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:48:29,322 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:48:29,322 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:48:29,323 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:48:29,324 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:48:29,326 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:48:29,327 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:48:29,328 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:48:29,329 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:48:29,330 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:48:29,331 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:48:29,331 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:48:29,332 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:48:29,332 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:48:29,333 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:48:29,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:48:29,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:48:29,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:48:29,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:48:29,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:48:29,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:48:29,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:48:29,337 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:48:29,337 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-28 10:48:29,347 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:48:29,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:48:29,348 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 10:48:29,348 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 10:48:29,349 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:48:29,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:48:29,349 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:48:29,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:48:29,349 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:48:29,350 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:48:29,350 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:48:29,350 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:48:29,350 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:48:29,350 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-28 10:48:29,350 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-28 10:48:29,350 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-28 10:48:29,351 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 10:48:29,351 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:48:29,351 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:48:29,351 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:48:29,351 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:48:29,351 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 10:48:29,351 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 10:48:29,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:48:29,352 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:48:29,352 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 10:48:29,352 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:48:29,352 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 10:48:29,352 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer 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 -> 1197d671a588cd166018a116686924380f8bf0f7 [2018-11-28 10:48:29,375 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:48:29,384 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:48:29,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:48:29,388 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:48:29,388 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:48:29,389 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety/test-0232_false-valid-free.i [2018-11-28 10:48:29,429 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/data/4b7a26fd1/2e9b8968f91e42938a2f1a4f1d06c975/FLAG9baf72ff4 [2018-11-28 10:48:29,866 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:48:29,867 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/sv-benchmarks/c/memsafety/test-0232_false-valid-free.i [2018-11-28 10:48:29,873 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/data/4b7a26fd1/2e9b8968f91e42938a2f1a4f1d06c975/FLAG9baf72ff4 [2018-11-28 10:48:29,883 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/data/4b7a26fd1/2e9b8968f91e42938a2f1a4f1d06c975 [2018-11-28 10:48:29,886 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:48:29,887 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-28 10:48:29,887 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:48:29,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:48:29,890 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:48:29,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:48:29" (1/1) ... [2018-11-28 10:48:29,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd293b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:29, skipping insertion in model container [2018-11-28 10:48:29,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:48:29" (1/1) ... [2018-11-28 10:48:29,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:48:29,916 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:48:30,104 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:48:30,110 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:48:30,193 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:48:30,223 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:48:30,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:30 WrapperNode [2018-11-28 10:48:30,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:48:30,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:48:30,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:48:30,224 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:48:30,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:30" (1/1) ... [2018-11-28 10:48:30,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:30" (1/1) ... [2018-11-28 10:48:30,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:30" (1/1) ... [2018-11-28 10:48:30,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:30" (1/1) ... [2018-11-28 10:48:30,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:30" (1/1) ... [2018-11-28 10:48:30,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:30" (1/1) ... [2018-11-28 10:48:30,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:30" (1/1) ... [2018-11-28 10:48:30,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:48:30,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:48:30,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:48:30,262 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:48:30,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 10:48:30,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 10:48:30,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:48:30,303 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-28 10:48:30,303 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 10:48:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-28 10:48:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-28 10:48:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-28 10:48:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-28 10:48:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-28 10:48:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-28 10:48:30,303 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-28 10:48:30,304 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-28 10:48:30,305 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-28 10:48:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-28 10:48:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-28 10:48:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-28 10:48:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-28 10:48:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-28 10:48:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-28 10:48:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-28 10:48:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-28 10:48:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-28 10:48:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-28 10:48:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-28 10:48:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-28 10:48:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-28 10:48:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-28 10:48:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-28 10:48:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-28 10:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-28 10:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-28 10:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-28 10:48:30,308 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-28 10:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-28 10:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-28 10:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-28 10:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-28 10:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-28 10:48:30,309 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-28 10:48:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-28 10:48:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-28 10:48:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-28 10:48:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-28 10:48:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-28 10:48:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-28 10:48:30,310 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-28 10:48:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-28 10:48:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-28 10:48:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-11-28 10:48:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-28 10:48:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-28 10:48:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-28 10:48:30,311 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-28 10:48:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-28 10:48:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-28 10:48:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-28 10:48:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-28 10:48:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-28 10:48:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-28 10:48:30,312 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-28 10:48:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-28 10:48:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-28 10:48:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-28 10:48:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-28 10:48:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-28 10:48:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-28 10:48:30,313 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-28 10:48:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-28 10:48:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-28 10:48:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-28 10:48:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-28 10:48:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-28 10:48:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-28 10:48:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-28 10:48:30,314 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-28 10:48:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-28 10:48:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-28 10:48:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-28 10:48:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-28 10:48:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-28 10:48:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-28 10:48:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-28 10:48:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-28 10:48:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-28 10:48:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-28 10:48:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-28 10:48:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-28 10:48:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 10:48:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 10:48:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 10:48:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 10:48:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 10:48:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 10:48:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 10:48:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:48:30,714 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:48:30,715 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-28 10:48:30,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:30 BoogieIcfgContainer [2018-11-28 10:48:30,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:48:30,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 10:48:30,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 10:48:30,718 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 10:48:30,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:48:29" (1/3) ... [2018-11-28 10:48:30,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564a6517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:48:30, skipping insertion in model container [2018-11-28 10:48:30,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:30" (2/3) ... [2018-11-28 10:48:30,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564a6517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:48:30, skipping insertion in model container [2018-11-28 10:48:30,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:30" (3/3) ... [2018-11-28 10:48:30,720 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-11-28 10:48:30,727 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 10:48:30,733 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 51 error locations. [2018-11-28 10:48:30,742 INFO L257 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2018-11-28 10:48:30,759 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:48:30,759 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 10:48:30,759 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-28 10:48:30,759 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 10:48:30,759 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:48:30,760 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:48:30,760 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 10:48:30,760 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:48:30,760 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 10:48:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states. [2018-11-28 10:48:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-28 10:48:30,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:30,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:30,782 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:30,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1830902200, now seen corresponding path program 1 times [2018-11-28 10:48:30,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:30,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:30,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:30,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:30,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:30,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:30,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:48:30,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-28 10:48:30,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 10:48:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 10:48:30,882 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 2 states. [2018-11-28 10:48:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:30,897 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2018-11-28 10:48:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 10:48:30,898 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2018-11-28 10:48:30,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:30,907 INFO L225 Difference]: With dead ends: 106 [2018-11-28 10:48:30,907 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 10:48:30,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 10:48:30,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 10:48:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-11-28 10:48:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 10:48:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2018-11-28 10:48:30,934 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 8 [2018-11-28 10:48:30,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:30,934 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2018-11-28 10:48:30,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-28 10:48:30,935 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2018-11-28 10:48:30,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 10:48:30,935 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:30,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:30,935 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:30,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:30,936 INFO L82 PathProgramCache]: Analyzing trace with hash 923514391, now seen corresponding path program 1 times [2018-11-28 10:48:30,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:30,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:30,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:30,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:30,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:31,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:31,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:48:31,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:48:31,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:48:31,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:48:31,038 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 5 states. [2018-11-28 10:48:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:31,260 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2018-11-28 10:48:31,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:48:31,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 10:48:31,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:31,261 INFO L225 Difference]: With dead ends: 97 [2018-11-28 10:48:31,262 INFO L226 Difference]: Without dead ends: 97 [2018-11-28 10:48:31,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:48:31,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-28 10:48:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-28 10:48:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 10:48:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-11-28 10:48:31,269 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 9 [2018-11-28 10:48:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:31,269 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-11-28 10:48:31,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:48:31,270 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-11-28 10:48:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-28 10:48:31,270 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:31,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:31,271 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:31,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash 923514392, now seen corresponding path program 1 times [2018-11-28 10:48:31,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:31,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:31,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:31,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:31,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:31,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:48:31,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:48:31,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:48:31,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:48:31,335 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 5 states. [2018-11-28 10:48:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:31,545 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-11-28 10:48:31,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:48:31,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-11-28 10:48:31,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:31,547 INFO L225 Difference]: With dead ends: 121 [2018-11-28 10:48:31,547 INFO L226 Difference]: Without dead ends: 121 [2018-11-28 10:48:31,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:48:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-28 10:48:31,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2018-11-28 10:48:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 10:48:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-11-28 10:48:31,554 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 9 [2018-11-28 10:48:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:31,555 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-11-28 10:48:31,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:48:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2018-11-28 10:48:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 10:48:31,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:31,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:31,556 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:31,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1435824870, now seen corresponding path program 1 times [2018-11-28 10:48:31,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:31,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:31,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:31,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:31,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:31,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:48:31,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:48:31,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:48:31,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:31,588 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand 3 states. [2018-11-28 10:48:31,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:31,644 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-11-28 10:48:31,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:48:31,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 10:48:31,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:31,645 INFO L225 Difference]: With dead ends: 99 [2018-11-28 10:48:31,645 INFO L226 Difference]: Without dead ends: 99 [2018-11-28 10:48:31,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-28 10:48:31,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-11-28 10:48:31,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 10:48:31,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2018-11-28 10:48:31,651 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 10 [2018-11-28 10:48:31,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:31,651 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-11-28 10:48:31,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:48:31,651 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2018-11-28 10:48:31,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-28 10:48:31,652 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:31,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:31,652 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:31,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:31,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1435824871, now seen corresponding path program 1 times [2018-11-28 10:48:31,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:31,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:31,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:31,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:31,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:31,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:48:31,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:48:31,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:48:31,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:31,695 INFO L87 Difference]: Start difference. First operand 99 states and 109 transitions. Second operand 3 states. [2018-11-28 10:48:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:31,743 INFO L93 Difference]: Finished difference Result 95 states and 104 transitions. [2018-11-28 10:48:31,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:48:31,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-28 10:48:31,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:31,744 INFO L225 Difference]: With dead ends: 95 [2018-11-28 10:48:31,744 INFO L226 Difference]: Without dead ends: 95 [2018-11-28 10:48:31,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:31,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-28 10:48:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-11-28 10:48:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 10:48:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-11-28 10:48:31,748 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 10 [2018-11-28 10:48:31,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:31,749 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-11-28 10:48:31,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:48:31,749 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2018-11-28 10:48:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 10:48:31,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:31,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:31,750 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:31,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:31,750 INFO L82 PathProgramCache]: Analyzing trace with hash 2128044514, now seen corresponding path program 1 times [2018-11-28 10:48:31,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:31,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:31,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:31,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:31,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:31,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 10:48:31,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 10:48:31,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:48:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:48:31,830 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand 8 states. [2018-11-28 10:48:31,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:31,995 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2018-11-28 10:48:31,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 10:48:31,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-28 10:48:31,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:31,997 INFO L225 Difference]: With dead ends: 106 [2018-11-28 10:48:31,997 INFO L226 Difference]: Without dead ends: 106 [2018-11-28 10:48:31,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-28 10:48:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-28 10:48:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-11-28 10:48:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 10:48:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2018-11-28 10:48:32,006 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 15 [2018-11-28 10:48:32,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:32,006 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2018-11-28 10:48:32,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 10:48:32,006 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2018-11-28 10:48:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 10:48:32,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:32,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:32,007 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:32,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:32,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1545148638, now seen corresponding path program 1 times [2018-11-28 10:48:32,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:32,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:32,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:32,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:32,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:32,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:48:32,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:48:32,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:48:32,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:48:32,099 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand 7 states. [2018-11-28 10:48:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:32,193 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2018-11-28 10:48:32,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:48:32,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-28 10:48:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:32,194 INFO L225 Difference]: With dead ends: 101 [2018-11-28 10:48:32,194 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 10:48:32,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-28 10:48:32,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 10:48:32,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-11-28 10:48:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-28 10:48:32,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-11-28 10:48:32,198 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 16 [2018-11-28 10:48:32,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:32,198 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-11-28 10:48:32,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:48:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-11-28 10:48:32,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 10:48:32,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:32,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:32,200 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:32,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1729987530, now seen corresponding path program 1 times [2018-11-28 10:48:32,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:32,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:32,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:32,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:48:32,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:48:32,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:48:32,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:48:32,266 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 7 states. [2018-11-28 10:48:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:32,392 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2018-11-28 10:48:32,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:48:32,393 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-28 10:48:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:32,393 INFO L225 Difference]: With dead ends: 111 [2018-11-28 10:48:32,394 INFO L226 Difference]: Without dead ends: 111 [2018-11-28 10:48:32,394 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 [2018-11-28 10:48:32,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-28 10:48:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2018-11-28 10:48:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-28 10:48:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2018-11-28 10:48:32,410 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 24 [2018-11-28 10:48:32,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:32,411 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2018-11-28 10:48:32,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:48:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2018-11-28 10:48:32,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 10:48:32,412 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:32,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:32,414 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:32,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:32,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1729987531, now seen corresponding path program 1 times [2018-11-28 10:48:32,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:32,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:32,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:32,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:32,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:32,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:48:32,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:48:32,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:48:32,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:48:32,521 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand 7 states. [2018-11-28 10:48:32,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:32,691 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2018-11-28 10:48:32,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:48:32,691 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-28 10:48:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:32,692 INFO L225 Difference]: With dead ends: 116 [2018-11-28 10:48:32,692 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 10:48:32,693 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 [2018-11-28 10:48:32,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 10:48:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-11-28 10:48:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 10:48:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-11-28 10:48:32,697 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 24 [2018-11-28 10:48:32,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:32,697 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-11-28 10:48:32,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:48:32,697 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-11-28 10:48:32,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 10:48:32,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:32,698 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] [2018-11-28 10:48:32,698 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:32,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:32,699 INFO L82 PathProgramCache]: Analyzing trace with hash 393473866, now seen corresponding path program 1 times [2018-11-28 10:48:32,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:32,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:32,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:32,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:32,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:32,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:48:32,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:48:32,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:48:32,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:48:32,752 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 6 states. [2018-11-28 10:48:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:32,835 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-11-28 10:48:32,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:48:32,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-28 10:48:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:32,836 INFO L225 Difference]: With dead ends: 88 [2018-11-28 10:48:32,836 INFO L226 Difference]: Without dead ends: 88 [2018-11-28 10:48:32,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:48:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-28 10:48:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-28 10:48:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-28 10:48:32,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-11-28 10:48:32,839 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 26 [2018-11-28 10:48:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:32,839 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-11-28 10:48:32,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:48:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-11-28 10:48:32,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 10:48:32,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:32,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:32,841 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:32,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:32,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1549046728, now seen corresponding path program 1 times [2018-11-28 10:48:32,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:32,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:32,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:32,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:32,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:32,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:32,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:48:32,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 10:48:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:48:32,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:48:32,922 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 7 states. [2018-11-28 10:48:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:33,070 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-11-28 10:48:33,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:48:33,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-28 10:48:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:33,071 INFO L225 Difference]: With dead ends: 87 [2018-11-28 10:48:33,072 INFO L226 Difference]: Without dead ends: 87 [2018-11-28 10:48:33,072 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 [2018-11-28 10:48:33,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-28 10:48:33,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-11-28 10:48:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 10:48:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2018-11-28 10:48:33,075 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 27 [2018-11-28 10:48:33,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:33,076 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2018-11-28 10:48:33,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 10:48:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2018-11-28 10:48:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 10:48:33,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:33,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,077 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:33,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1549046727, now seen corresponding path program 1 times [2018-11-28 10:48:33,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:33,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:33,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:33,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 10:48:33,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 10:48:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:48:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:48:33,188 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand 8 states. [2018-11-28 10:48:33,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:33,303 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-11-28 10:48:33,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 10:48:33,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-28 10:48:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:33,305 INFO L225 Difference]: With dead ends: 86 [2018-11-28 10:48:33,305 INFO L226 Difference]: Without dead ends: 86 [2018-11-28 10:48:33,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-28 10:48:33,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-28 10:48:33,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-28 10:48:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 10:48:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-11-28 10:48:33,307 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 27 [2018-11-28 10:48:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:33,308 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-11-28 10:48:33,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 10:48:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-11-28 10:48:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 10:48:33,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:33,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,309 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:33,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash -775808307, now seen corresponding path program 1 times [2018-11-28 10:48:33,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:33,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:33,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:33,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 10:48:33,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 10:48:33,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 10:48:33,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 10:48:33,581 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 12 states. [2018-11-28 10:48:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:33,954 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-11-28 10:48:33,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 10:48:33,954 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-11-28 10:48:33,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:33,955 INFO L225 Difference]: With dead ends: 118 [2018-11-28 10:48:33,955 INFO L226 Difference]: Without dead ends: 118 [2018-11-28 10:48:33,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-11-28 10:48:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-28 10:48:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2018-11-28 10:48:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 10:48:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-11-28 10:48:33,958 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 28 [2018-11-28 10:48:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:33,959 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-11-28 10:48:33,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 10:48:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-11-28 10:48:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 10:48:33,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:33,960 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,960 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:33,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1761151540, now seen corresponding path program 1 times [2018-11-28 10:48:33,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:33,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:34,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:34,097 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:34,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:34,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:34,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:48:34,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:48:34,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-28 10:48:34,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-11-28 10:48:34,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-11-28 10:48:34,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 10:48:34,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 10:48:34,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:34,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-11-28 10:48:34,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-11-28 10:48:34,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-11-28 10:48:34,450 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-11-28 10:48:34,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2018-11-28 10:48:34,477 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:34,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:34,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:33, output treesize:11 [2018-11-28 10:48:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:34,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:34,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-11-28 10:48:34,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:48:34,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:48:34,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:48:34,531 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 17 states. [2018-11-28 10:48:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:35,091 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-11-28 10:48:35,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 10:48:35,091 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-11-28 10:48:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:35,092 INFO L225 Difference]: With dead ends: 105 [2018-11-28 10:48:35,092 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 10:48:35,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2018-11-28 10:48:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 10:48:35,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2018-11-28 10:48:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 10:48:35,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-11-28 10:48:35,095 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 29 [2018-11-28 10:48:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:35,095 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-11-28 10:48:35,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:48:35,095 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-11-28 10:48:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 10:48:35,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:35,096 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:35,096 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:35,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:35,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1761151541, now seen corresponding path program 1 times [2018-11-28 10:48:35,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:35,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:35,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:35,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:35,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:35,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:35,241 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:35,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:35,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:35,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:48:35,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:48:35,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:48:35,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:48:35,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,309 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,314 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:26 [2018-11-28 10:48:35,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:35,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 10:48:35,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:35,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:35,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:48:35,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:33 [2018-11-28 10:48:35,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2018-11-28 10:48:35,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-28 10:48:35,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 33 [2018-11-28 10:48:35,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-28 10:48:35,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:35,476 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:60, output treesize:52 [2018-11-28 10:48:35,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2018-11-28 10:48:35,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-11-28 10:48:35,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-11-28 10:48:35,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-11-28 10:48:35,538 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:48:35,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2018-11-28 10:48:35,558 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:35,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:35,566 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:66, output treesize:18 [2018-11-28 10:48:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:35,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:35,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2018-11-28 10:48:35,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:48:35,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:48:35,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2018-11-28 10:48:35,601 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 17 states. [2018-11-28 10:48:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:36,168 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-28 10:48:36,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 10:48:36,169 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-11-28 10:48:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:36,170 INFO L225 Difference]: With dead ends: 101 [2018-11-28 10:48:36,170 INFO L226 Difference]: Without dead ends: 101 [2018-11-28 10:48:36,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=446, Unknown=1, NotChecked=0, Total=552 [2018-11-28 10:48:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-28 10:48:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-11-28 10:48:36,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 10:48:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2018-11-28 10:48:36,173 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 29 [2018-11-28 10:48:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:36,173 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2018-11-28 10:48:36,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:48:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2018-11-28 10:48:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 10:48:36,173 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:36,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:36,174 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:36,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:36,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1719746328, now seen corresponding path program 1 times [2018-11-28 10:48:36,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:36,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:36,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:36,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:36,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:36,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 10:48:36,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 10:48:36,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 10:48:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-28 10:48:36,365 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand 12 states. [2018-11-28 10:48:36,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:36,671 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2018-11-28 10:48:36,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 10:48:36,672 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-28 10:48:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:36,673 INFO L225 Difference]: With dead ends: 110 [2018-11-28 10:48:36,673 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 10:48:36,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2018-11-28 10:48:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 10:48:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 100. [2018-11-28 10:48:36,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-28 10:48:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2018-11-28 10:48:36,676 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 29 [2018-11-28 10:48:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:36,682 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2018-11-28 10:48:36,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 10:48:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2018-11-28 10:48:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 10:48:36,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:36,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:36,683 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:36,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:36,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1772528688, now seen corresponding path program 1 times [2018-11-28 10:48:36,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:36,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:36,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:36,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:36,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:36,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:36,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 10:48:36,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 10:48:36,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 10:48:36,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 10:48:36,922 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 13 states. [2018-11-28 10:48:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:37,357 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2018-11-28 10:48:37,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 10:48:37,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-28 10:48:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:37,358 INFO L225 Difference]: With dead ends: 129 [2018-11-28 10:48:37,358 INFO L226 Difference]: Without dead ends: 129 [2018-11-28 10:48:37,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2018-11-28 10:48:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-28 10:48:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2018-11-28 10:48:37,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 10:48:37,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2018-11-28 10:48:37,362 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 30 [2018-11-28 10:48:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:37,362 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2018-11-28 10:48:37,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 10:48:37,362 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2018-11-28 10:48:37,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 10:48:37,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:37,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:37,363 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:37,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:37,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1772528689, now seen corresponding path program 1 times [2018-11-28 10:48:37,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:37,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:37,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:37,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:37,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:37,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:48:37,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 10:48:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:48:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:37,393 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand 3 states. [2018-11-28 10:48:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:37,428 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-11-28 10:48:37,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:48:37,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 10:48:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:37,428 INFO L225 Difference]: With dead ends: 110 [2018-11-28 10:48:37,428 INFO L226 Difference]: Without dead ends: 110 [2018-11-28 10:48:37,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:37,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-28 10:48:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-28 10:48:37,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 10:48:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2018-11-28 10:48:37,431 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 30 [2018-11-28 10:48:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:37,431 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2018-11-28 10:48:37,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 10:48:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2018-11-28 10:48:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 10:48:37,432 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:37,432 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] [2018-11-28 10:48:37,432 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:37,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:37,433 INFO L82 PathProgramCache]: Analyzing trace with hash -886185508, now seen corresponding path program 1 times [2018-11-28 10:48:37,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:37,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:37,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:37,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:37,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:37,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:37,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:48:37,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 10:48:37,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:48:37,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:48:37,486 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 6 states. [2018-11-28 10:48:37,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:37,552 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2018-11-28 10:48:37,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:48:37,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-28 10:48:37,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:37,553 INFO L225 Difference]: With dead ends: 109 [2018-11-28 10:48:37,553 INFO L226 Difference]: Without dead ends: 109 [2018-11-28 10:48:37,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:48:37,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-28 10:48:37,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-11-28 10:48:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 10:48:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-11-28 10:48:37,556 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 31 [2018-11-28 10:48:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:37,557 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-11-28 10:48:37,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 10:48:37,557 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-11-28 10:48:37,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-28 10:48:37,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:37,557 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] [2018-11-28 10:48:37,557 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:37,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:37,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1701946896, now seen corresponding path program 1 times [2018-11-28 10:48:37,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:37,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:37,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:37,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:37,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:37,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:37,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-28 10:48:37,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 10:48:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 10:48:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-28 10:48:37,838 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 13 states. [2018-11-28 10:48:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:38,152 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2018-11-28 10:48:38,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 10:48:38,152 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 32 [2018-11-28 10:48:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:38,153 INFO L225 Difference]: With dead ends: 117 [2018-11-28 10:48:38,153 INFO L226 Difference]: Without dead ends: 117 [2018-11-28 10:48:38,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2018-11-28 10:48:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-28 10:48:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2018-11-28 10:48:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-28 10:48:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2018-11-28 10:48:38,156 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 32 [2018-11-28 10:48:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:38,156 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2018-11-28 10:48:38,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 10:48:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2018-11-28 10:48:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 10:48:38,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:38,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:38,157 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:38,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:38,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1220746145, now seen corresponding path program 1 times [2018-11-28 10:48:38,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:38,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:38,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:38,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:38,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:38,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:38,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 10:48:38,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 10:48:38,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:48:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:48:38,227 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 8 states. [2018-11-28 10:48:38,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:38,354 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2018-11-28 10:48:38,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 10:48:38,355 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-11-28 10:48:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:38,356 INFO L225 Difference]: With dead ends: 116 [2018-11-28 10:48:38,356 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 10:48:38,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-28 10:48:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 10:48:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-11-28 10:48:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-28 10:48:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2018-11-28 10:48:38,360 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 33 [2018-11-28 10:48:38,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:38,360 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2018-11-28 10:48:38,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 10:48:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2018-11-28 10:48:38,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 10:48:38,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:38,360 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, 1, 1] [2018-11-28 10:48:38,361 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:38,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:38,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1265757093, now seen corresponding path program 1 times [2018-11-28 10:48:38,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:38,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:38,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:38,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:38,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:39,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:39,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 10:48:39,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:48:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:48:39,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:48:39,054 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand 17 states. [2018-11-28 10:48:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:39,688 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-11-28 10:48:39,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 10:48:39,689 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-11-28 10:48:39,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:39,689 INFO L225 Difference]: With dead ends: 139 [2018-11-28 10:48:39,689 INFO L226 Difference]: Without dead ends: 137 [2018-11-28 10:48:39,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-11-28 10:48:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-28 10:48:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 117. [2018-11-28 10:48:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-28 10:48:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-11-28 10:48:39,693 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 37 [2018-11-28 10:48:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:39,693 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-11-28 10:48:39,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:48:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-11-28 10:48:39,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 10:48:39,693 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:39,694 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, 1, 1] [2018-11-28 10:48:39,694 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:39,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1265757865, now seen corresponding path program 1 times [2018-11-28 10:48:39,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:39,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:39,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:40,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:40,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-11-28 10:48:40,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 10:48:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 10:48:40,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-11-28 10:48:40,026 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 16 states. [2018-11-28 10:48:40,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:40,482 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-11-28 10:48:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-28 10:48:40,483 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-11-28 10:48:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:40,483 INFO L225 Difference]: With dead ends: 118 [2018-11-28 10:48:40,483 INFO L226 Difference]: Without dead ends: 103 [2018-11-28 10:48:40,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2018-11-28 10:48:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-28 10:48:40,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-11-28 10:48:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 10:48:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-11-28 10:48:40,487 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 37 [2018-11-28 10:48:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:40,487 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-11-28 10:48:40,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 10:48:40,487 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-11-28 10:48:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-28 10:48:40,487 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:40,488 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:40,488 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:40,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:40,488 INFO L82 PathProgramCache]: Analyzing trace with hash 177997755, now seen corresponding path program 1 times [2018-11-28 10:48:40,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:40,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:40,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:40,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:40,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:40,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:40,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:40,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:40,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:40,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:48:40,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:48:40,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:40,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:40,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:40,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-28 10:48:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:40,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:40,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-11-28 10:48:40,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 10:48:40,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 10:48:40,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-11-28 10:48:40,894 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 17 states. [2018-11-28 10:48:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:41,406 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-11-28 10:48:41,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 10:48:41,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-11-28 10:48:41,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:41,406 INFO L225 Difference]: With dead ends: 83 [2018-11-28 10:48:41,407 INFO L226 Difference]: Without dead ends: 83 [2018-11-28 10:48:41,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2018-11-28 10:48:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-28 10:48:41,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-28 10:48:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 10:48:41,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-11-28 10:48:41,409 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 42 [2018-11-28 10:48:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:41,409 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-11-28 10:48:41,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 10:48:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-11-28 10:48:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-28 10:48:41,410 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:41,410 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:41,411 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:41,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:41,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1970667529, now seen corresponding path program 1 times [2018-11-28 10:48:41,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:41,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:41,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:41,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:41,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:42,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:42,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:42,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:42,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:42,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 10:48:42,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:48:42,285 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 13 treesize of output 10 [2018-11-28 10:48:42,288 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 10 treesize of output 9 [2018-11-28 10:48:42,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-28 10:48:42,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:48:42,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:48:42,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,360 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 19 treesize of output 43 [2018-11-28 10:48:42,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-28 10:48:42,365 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,380 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,387 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-11-28 10:48:42,454 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:42,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:42,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:48:42,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:44 [2018-11-28 10:48:42,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:48:42,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:48:42,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:135 [2018-11-28 10:48:42,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:42,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:42,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:42,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-11-28 10:48:42,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 91 [2018-11-28 10:48:42,918 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 40 [2018-11-28 10:48:42,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:42,922 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:48:42,923 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 40 treesize of output 102 [2018-11-28 10:48:42,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,945 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:48:42,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 101 [2018-11-28 10:48:42,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2018-11-28 10:48:42,949 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,957 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,963 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:42,973 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 74 treesize of output 64 [2018-11-28 10:48:42,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-11-28 10:48:42,976 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:42,983 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:42,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:42,998 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:178, output treesize:72 [2018-11-28 10:48:43,044 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 54 treesize of output 44 [2018-11-28 10:48:43,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 44 treesize of output 31 [2018-11-28 10:48:43,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:43,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:43,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:43,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:56 [2018-11-28 10:48:43,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-11-28 10:48:43,117 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 20 treesize of output 13 [2018-11-28 10:48:43,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:43,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:43,127 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:48:43,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-11-28 10:48:43,128 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:43,134 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 7 treesize of output 1 [2018-11-28 10:48:43,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:43,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:43,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:43,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:3 [2018-11-28 10:48:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:43,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:43,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 35 [2018-11-28 10:48:43,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-28 10:48:43,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-28 10:48:43,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1143, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 10:48:43,166 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 36 states. [2018-11-28 10:48:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:44,927 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-11-28 10:48:44,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-28 10:48:44,928 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 45 [2018-11-28 10:48:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:44,929 INFO L225 Difference]: With dead ends: 135 [2018-11-28 10:48:44,929 INFO L226 Difference]: Without dead ends: 135 [2018-11-28 10:48:44,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=408, Invalid=3752, Unknown=0, NotChecked=0, Total=4160 [2018-11-28 10:48:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-11-28 10:48:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 82. [2018-11-28 10:48:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-28 10:48:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-11-28 10:48:44,933 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 45 [2018-11-28 10:48:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:44,933 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-11-28 10:48:44,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-28 10:48:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-11-28 10:48:44,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 10:48:44,934 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:44,934 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:44,934 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:44,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:44,934 INFO L82 PathProgramCache]: Analyzing trace with hash 961151324, now seen corresponding path program 1 times [2018-11-28 10:48:44,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:44,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:44,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:45,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:45,826 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:45,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:45,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:45,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 10:48:45,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:45,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:45,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:48:45,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 10:48:45,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:45,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:45,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-11-28 10:48:45,984 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 13 treesize of output 10 [2018-11-28 10:48:45,987 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 10 treesize of output 9 [2018-11-28 10:48:45,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:45,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:45,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:45,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-11-28 10:48:46,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:48:46,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:48:46,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:46,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:46,046 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 21 treesize of output 33 [2018-11-28 10:48:46,048 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 22 treesize of output 21 [2018-11-28 10:48:46,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:46,062 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:46,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:46,068 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44 [2018-11-28 10:48:46,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:46,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:46,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:48:46,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:46,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:46,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:46 [2018-11-28 10:48:46,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:48:46,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:48:46,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:46,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:46,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:46,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:116, output treesize:112 [2018-11-28 10:48:48,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:48,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:48,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:48,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:48,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 71 [2018-11-28 10:48:48,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,645 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 48 treesize of output 44 [2018-11-28 10:48:48,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-11-28 10:48:48,651 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 86 [2018-11-28 10:48:48,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 10:48:48,681 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 28 treesize of output 29 [2018-11-28 10:48:48,681 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,685 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,698 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:48,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:48,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 87 [2018-11-28 10:48:48,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2018-11-28 10:48:48,704 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,714 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,721 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,736 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:128 [2018-11-28 10:48:48,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 10:48:48,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 10:48:48,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:48,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:137, output treesize:126 [2018-11-28 10:48:48,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:48,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:48,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 76 [2018-11-28 10:48:48,936 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-11-28 10:48:48,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 10:48:48,966 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 42 treesize of output 35 [2018-11-28 10:48:48,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,968 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 36 treesize of output 29 [2018-11-28 10:48:48,968 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:48,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 32 [2018-11-28 10:48:48,989 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:49,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 52 [2018-11-28 10:48:49,003 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-28 10:48:49,056 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-11-28 10:48:49,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2018-11-28 10:48:49,101 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:127, output treesize:177 [2018-11-28 10:48:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:49,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:49,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 40 [2018-11-28 10:48:49,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-28 10:48:49,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-28 10:48:49,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1491, Unknown=1, NotChecked=0, Total=1640 [2018-11-28 10:48:49,220 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 41 states. [2018-11-28 10:48:50,085 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2018-11-28 10:48:54,336 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-11-28 10:48:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:54,860 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-11-28 10:48:54,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 10:48:54,861 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 46 [2018-11-28 10:48:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:48:54,861 INFO L225 Difference]: With dead ends: 82 [2018-11-28 10:48:54,861 INFO L226 Difference]: Without dead ends: 82 [2018-11-28 10:48:54,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=283, Invalid=2686, Unknown=1, NotChecked=0, Total=2970 [2018-11-28 10:48:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-28 10:48:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-28 10:48:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-28 10:48:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-11-28 10:48:54,864 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 46 [2018-11-28 10:48:54,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:48:54,864 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-11-28 10:48:54,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-28 10:48:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-11-28 10:48:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-28 10:48:54,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:48:54,865 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:54,865 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:48:54,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:54,866 INFO L82 PathProgramCache]: Analyzing trace with hash -269079956, now seen corresponding path program 1 times [2018-11-28 10:48:54,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:54,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:54,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:54,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:55,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:55,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:55,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:55,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:55,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 10:48:55,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:48:55,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:55,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:55,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 10:48:55,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-11-28 10:48:55,689 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 13 treesize of output 10 [2018-11-28 10:48:55,691 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 10 treesize of output 9 [2018-11-28 10:48:55,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2018-11-28 10:48:55,735 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 20 treesize of output 32 [2018-11-28 10:48:55,742 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 2 case distinctions, treesize of input 18 treesize of output 26 [2018-11-28 10:48:55,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 10:48:55,757 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 17 treesize of output 16 [2018-11-28 10:48:55,758 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:48:55,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:48:55,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:48:55,789 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,791 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:48:55,802 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:46, output treesize:72 [2018-11-28 10:48:55,835 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:48:55,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:55,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:55,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:48:55,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:55,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:88, output treesize:45 [2018-11-28 10:48:56,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:48:56,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:48:56,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:56,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:56,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:56,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:106 [2018-11-28 10:48:58,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:58,228 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:58,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:58,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-28 10:48:58,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,244 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 48 treesize of output 44 [2018-11-28 10:48:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-11-28 10:48:58,246 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-11-28 10:48:58,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-28 10:48:58,275 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 28 treesize of output 29 [2018-11-28 10:48:58,275 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,279 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:58,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:58,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-11-28 10:48:58,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-28 10:48:58,297 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,305 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,318 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:150, output treesize:80 [2018-11-28 10:48:58,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 10:48:58,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 10:48:58,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:94, output treesize:83 [2018-11-28 10:48:58,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:58,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:58,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 53 [2018-11-28 10:48:58,535 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-11-28 10:48:58,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 10:48: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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-28 10:48:58,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 10:48:58,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:84, output treesize:10 [2018-11-28 10:48:58,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:48:58,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 10:48:58,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:48:58,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:48:58,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-11-28 10:48:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:58,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:58,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 41 [2018-11-28 10:48:58,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-28 10:48:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-28 10:48:58,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1575, Unknown=1, NotChecked=0, Total=1722 [2018-11-28 10:48:58,627 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 42 states. [2018-11-28 10:49:41,187 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2018-11-28 10:49:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:42,192 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-11-28 10:49:42,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-28 10:49:42,192 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 47 [2018-11-28 10:49:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:49:42,193 INFO L225 Difference]: With dead ends: 131 [2018-11-28 10:49:42,193 INFO L226 Difference]: Without dead ends: 131 [2018-11-28 10:49:42,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1667 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=527, Invalid=5015, Unknown=8, NotChecked=0, Total=5550 [2018-11-28 10:49:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-28 10:49:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 80. [2018-11-28 10:49:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-28 10:49:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-11-28 10:49:42,198 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 47 [2018-11-28 10:49:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:49:42,198 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-11-28 10:49:42,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-28 10:49:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-11-28 10:49:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 10:49:42,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:49:42,199 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:42,199 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:49:42,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash -887799508, now seen corresponding path program 1 times [2018-11-28 10:49:42,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:42,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:42,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:42,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:42,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:49:42,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:49:42,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:49:42,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:42,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:49:42,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 10:49:42,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:49:42,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:49:42,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:49:42,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 10:49:42,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:49:42,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:49:42,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-11-28 10:49:43,010 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 13 treesize of output 10 [2018-11-28 10:49:43,012 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 10 treesize of output 9 [2018-11-28 10:49:43,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:49:43,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:49:43,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:49:43,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:31 [2018-11-28 10:49:43,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:49:43,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:49:43,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:49:43,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:49:43,087 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 21 treesize of output 33 [2018-11-28 10:49:43,090 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 22 treesize of output 21 [2018-11-28 10:49:43,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:49:43,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:49:43,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:49:43,113 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-11-28 10:49:43,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:49:43,142 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:49:43,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:49:43,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:49:43,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:49:43,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:41 [2018-11-28 10:49:55,023 WARN L180 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-28 10:50:25,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:25,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:25,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:25,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-11-28 10:50:25,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,655 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:50:25,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 102 [2018-11-28 10:50:25,664 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:50:25,665 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 75 [2018-11-28 10:50:25,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,676 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:25,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 82 [2018-11-28 10:50:25,676 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:25,686 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 58 [2018-11-28 10:50:25,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:25,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2018-11-28 10:50:25,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-28 10:50:25,708 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,712 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2018-11-28 10:50:25,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:25,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2018-11-28 10:50:25,719 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,723 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,725 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:50:25,725 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,729 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:50:25,730 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 24 treesize of output 20 [2018-11-28 10:50:25,730 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,733 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,737 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-11-28 10:50:25,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2018-11-28 10:50:25,749 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:25,751 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 34 treesize of output 41 [2018-11-28 10:50:25,751 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,756 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:25,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:25,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 77 [2018-11-28 10:50:25,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-28 10:50:25,777 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,786 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,794 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,813 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 66 treesize of output 62 [2018-11-28 10:50:25,815 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 27 treesize of output 23 [2018-11-28 10:50:25,816 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,823 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-28 10:50:25,826 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 3 [2018-11-28 10:50:25,826 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,830 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:25,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 10:50:25,844 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 5 variables, input treesize:149, output treesize:113 [2018-11-28 10:50:26,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:26,283 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 2 case distinctions, treesize of input 114 treesize of output 135 [2018-11-28 10:50:26,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-28 10:50:26,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:26,342 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 2 case distinctions, treesize of input 56 treesize of output 77 [2018-11-28 10:50:26,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 10:50:26,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-28 10:50:26,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:171, output treesize:361 [2018-11-28 10:50:26,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2018-11-28 10:50:26,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:26,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:26,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 54 [2018-11-28 10:50:26,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 10:50:26,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 10:50:26,657 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 49 treesize of output 43 [2018-11-28 10:50:26,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 15 [2018-11-28 10:50:26,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:26,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:26,669 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 37 treesize of output 33 [2018-11-28 10:50:26,670 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 14 treesize of output 6 [2018-11-28 10:50:26,671 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:26,677 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:26,784 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 127 treesize of output 123 [2018-11-28 10:50:26,786 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 23 treesize of output 15 [2018-11-28 10:50:26,786 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:26,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:26,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:26,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:26,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 79 [2018-11-28 10:50:26,880 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 18 treesize of output 10 [2018-11-28 10:50:26,880 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:26,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:26,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 50 [2018-11-28 10:50:26,914 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-28 10:50:26,949 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 19 treesize of output 10 [2018-11-28 10:50:26,949 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:26,971 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-11-28 10:50:27,068 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 139 treesize of output 133 [2018-11-28 10:50:27,069 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 42 treesize of output 33 [2018-11-28 10:50:27,070 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:27,082 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:27,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:27,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:27,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 81 [2018-11-28 10:50:27,165 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 54 [2018-11-28 10:50:27,166 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 10:50:27,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:50:27,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2018-11-28 10:50:27,187 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:27,197 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 6 treesize of output 4 [2018-11-28 10:50:27,198 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 10:50:27,204 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:50:27,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 8 dim-2 vars, End of recursive call: 11 dim-0 vars, and 7 xjuncts. [2018-11-28 10:50:27,345 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 16 variables, input treesize:421, output treesize:219 [2018-11-28 10:50:27,585 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:50:27,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:50:27,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 46 [2018-11-28 10:50:27,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-28 10:50:27,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-28 10:50:27,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1979, Unknown=35, NotChecked=0, Total=2162 [2018-11-28 10:50:27,606 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 47 states. [2018-11-28 10:51:47,977 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2018-11-28 10:51:53,312 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2018-11-28 10:51:58,349 WARN L180 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2018-11-28 10:52:11,728 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2018-11-28 10:52:14,874 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2018-11-28 10:52:20,517 WARN L180 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2018-11-28 10:52:25,335 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2018-11-28 10:52:26,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:52:26,949 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2018-11-28 10:52:26,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-28 10:52:26,949 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 49 [2018-11-28 10:52:26,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:52:26,950 INFO L225 Difference]: With dead ends: 132 [2018-11-28 10:52:26,950 INFO L226 Difference]: Without dead ends: 132 [2018-11-28 10:52:26,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1320 ImplicationChecksByTransitivity, 99.9s TimeCoverageRelationStatistics Valid=434, Invalid=5047, Unknown=69, NotChecked=0, Total=5550 [2018-11-28 10:52:26,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-28 10:52:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 95. [2018-11-28 10:52:26,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-28 10:52:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-11-28 10:52:26,955 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 49 [2018-11-28 10:52:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:52:26,955 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-11-28 10:52:26,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-28 10:52:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2018-11-28 10:52:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 10:52:26,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:52:26,956 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:52:26,956 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:52:26,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:52:26,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1751980893, now seen corresponding path program 1 times [2018-11-28 10:52:26,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:52:26,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:52:26,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:52:26,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:52:26,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:52:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:52:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:52:27,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:52:27,036 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:52:27,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:52:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:52:27,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:52:27,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:52:27,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:52:27,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-11-28 10:52:27,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:52:27,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:52:27,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:52:27,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2018-11-28 10:52:27,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-28 10:52:27,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 10:52:27,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:10 [2018-11-28 10:52:27,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:52:27,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 10:52:27,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:52:27,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 10:52:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:52:27,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:52:27,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 13 [2018-11-28 10:52:27,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 10:52:27,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 10:52:27,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-28 10:52:27,245 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 14 states. [2018-11-28 10:52:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:52:27,499 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-11-28 10:52:27,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 10:52:27,499 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-11-28 10:52:27,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:52:27,500 INFO L225 Difference]: With dead ends: 116 [2018-11-28 10:52:27,500 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 10:52:27,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-11-28 10:52:27,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 10:52:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 94. [2018-11-28 10:52:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-28 10:52:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-11-28 10:52:27,503 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 50 [2018-11-28 10:52:27,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:52:27,503 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-11-28 10:52:27,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 10:52:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-11-28 10:52:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 10:52:27,504 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:52:27,504 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:52:27,506 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:52:27,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:52:27,506 INFO L82 PathProgramCache]: Analyzing trace with hash 344336873, now seen corresponding path program 1 times [2018-11-28 10:52:27,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:52:27,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:52:27,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:52:27,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:52:27,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:52:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:52:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:52:27,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:52:27,835 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:52:27,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:52:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:52:27,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:52:27,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:52:27,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:52:27,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:27,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-11-28 10:52:31,642 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 10:52:32,673 WARN L854 $PredicateComparison]: unable to prove that (exists ((|append_#t~ite6.base| Int) (append_~item~0.base Int)) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| append_~item~0.base (store (store (select |c_old(#memory_$Pointer$.base)| append_~item~0.base) 0 (select (select |c_old(#memory_$Pointer$.base)| |c_append_#in~plist.base|) |c_append_#in~plist.offset|)) 4 |append_#t~ite6.base|)))) (store .cse0 |c_append_#in~plist.base| (store (select .cse0 |c_append_#in~plist.base|) |c_append_#in~plist.offset| append_~item~0.base))))) is different from true [2018-11-28 10:52:32,692 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 0 case distinctions, treesize of input 39 treesize of output 39 [2018-11-28 10:52:32,694 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 10:52:32,696 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 18 treesize of output 19 [2018-11-28 10:52:32,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,699 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,707 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-28 10:52:32,709 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 24 treesize of output 16 [2018-11-28 10:52:32,709 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,713 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,720 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 0 case distinctions, treesize of input 48 treesize of output 40 [2018-11-28 10:52:32,722 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-11-28 10:52:32,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:52:32,725 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 27 treesize of output 31 [2018-11-28 10:52:32,725 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,730 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,736 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 27 treesize of output 20 [2018-11-28 10:52:32,740 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:52:32,742 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-28 10:52:32,743 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,747 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,751 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:52:32,765 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:53, output treesize:28 [2018-11-28 10:52:32,870 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 45 treesize of output 41 [2018-11-28 10:52:32,872 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 19 treesize of output 11 [2018-11-28 10:52:32,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,877 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 40 treesize of output 36 [2018-11-28 10:52:32,879 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 19 treesize of output 11 [2018-11-28 10:52:32,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:52:32,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:86, output treesize:64 [2018-11-28 10:52:32,959 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 37 treesize of output 36 [2018-11-28 10:52:32,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,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 32 treesize of output 31 [2018-11-28 10:52:32,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:32,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:52:32,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:68 [2018-11-28 10:52:33,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:52:33,015 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:52:33,015 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 49 treesize of output 43 [2018-11-28 10:52:33,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:33,016 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:52:33,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:33,027 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 0 case distinctions, treesize of input 40 treesize of output 32 [2018-11-28 10:52:33,029 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-28 10:52:33,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:52:33,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:52:33,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:52:33,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:94, output treesize:27 [2018-11-28 10:52:33,065 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 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-28 10:52:33,066 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 14 treesize of output 6 [2018-11-28 10:52:33,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:33,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 10:52:33,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:33,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:33,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:33,073 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:4 [2018-11-28 10:52:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-28 10:52:33,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:52:33,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 36 [2018-11-28 10:52:33,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-28 10:52:33,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-28 10:52:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1084, Unknown=8, NotChecked=66, Total=1260 [2018-11-28 10:52:33,104 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 36 states. [2018-11-28 10:52:39,274 WARN L180 SmtUtils]: Spent 994.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-11-28 10:52:43,442 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2018-11-28 10:52:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:52:49,059 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-11-28 10:52:49,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-28 10:52:49,059 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-11-28 10:52:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:52:49,060 INFO L225 Difference]: With dead ends: 119 [2018-11-28 10:52:49,060 INFO L226 Difference]: Without dead ends: 119 [2018-11-28 10:52:49,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=335, Invalid=2958, Unknown=17, NotChecked=112, Total=3422 [2018-11-28 10:52:49,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-28 10:52:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2018-11-28 10:52:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 10:52:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-11-28 10:52:49,064 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 54 [2018-11-28 10:52:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:52:49,064 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-11-28 10:52:49,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-28 10:52:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2018-11-28 10:52:49,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 10:52:49,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:52:49,065 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:52:49,065 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:52:49,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:52:49,066 INFO L82 PathProgramCache]: Analyzing trace with hash 344337645, now seen corresponding path program 1 times [2018-11-28 10:52:49,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:52:49,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:52:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:52:49,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:52:49,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:52:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:52:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:52:50,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:52:50,199 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:52:50,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:52:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:52:50,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:52:50,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:52:50,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:52:50,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 10:52:50,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:50,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:50,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-11-28 10:52:50,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 10:52:50,375 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 10 treesize of output 9 [2018-11-28 10:52:50,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:50,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:50,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:50,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-11-28 10:52:50,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:52:50,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:52:50,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:50,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:52:50,444 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 20 treesize of output 32 [2018-11-28 10:52:50,447 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 21 treesize of output 20 [2018-11-28 10:52:50,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:52:50,466 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 2 case distinctions, treesize of input 18 treesize of output 26 [2018-11-28 10:52:50,466 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-28 10:52:50,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:52:50,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 10:52:50,487 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:36, output treesize:57 [2018-11-28 10:53:01,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:53:01,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 77 [2018-11-28 10:53:01,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-11-28 10:53:01,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,361 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 32 treesize of output 55 [2018-11-28 10:53:01,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 91 [2018-11-28 10:53:01,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 82 [2018-11-28 10:53:01,401 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,430 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:53:01,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 86 [2018-11-28 10:53:01,434 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,448 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,456 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,460 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:53:01,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 107 [2018-11-28 10:53:01,469 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 76 [2018-11-28 10:53:01,470 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 76 [2018-11-28 10:53:01,486 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2018-11-28 10:53:01,515 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:53:01,515 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 67 [2018-11-28 10:53:01,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-11-28 10:53:01,522 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:01,531 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:01,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:01,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 79 [2018-11-28 10:53:01,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-11-28 10:53:01,538 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:01,549 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:01,567 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 44 treesize of output 25 [2018-11-28 10:53:01,567 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 56 treesize of output 33 [2018-11-28 10:53:01,569 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,582 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 10:53:01,597 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 10:53:01,624 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 35 treesize of output 33 [2018-11-28 10:53:01,626 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 3 [2018-11-28 10:53:01,626 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,632 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,634 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 69 treesize of output 65 [2018-11-28 10:53:01,636 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 25 treesize of output 21 [2018-11-28 10:53:01,636 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,643 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,645 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 43 treesize of output 41 [2018-11-28 10:53:01,647 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 3 [2018-11-28 10:53:01,647 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,655 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:01,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 10:53:01,681 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 4 variables, input treesize:143, output treesize:147 [2018-11-28 10:53:02,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:02,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 87 [2018-11-28 10:53:02,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-11-28 10:53:02,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:02,350 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 2 case distinctions, treesize of input 124 treesize of output 149 [2018-11-28 10:53:02,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 10:53:02,409 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 4 xjuncts. [2018-11-28 10:53:02,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:195, output treesize:420 [2018-11-28 10:53:02,554 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 106 treesize of output 94 [2018-11-28 10:53:02,556 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 77 treesize of output 62 [2018-11-28 10:53:02,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:02,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:02,640 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 137 treesize of output 129 [2018-11-28 10:53:02,643 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 41 treesize of output 30 [2018-11-28 10:53:02,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:02,656 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:02,722 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 149 treesize of output 139 [2018-11-28 10:53:02,724 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 64 treesize of output 51 [2018-11-28 10:53:02,725 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:02,737 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:02,799 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 83 treesize of output 75 [2018-11-28 10:53:02,801 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 41 treesize of output 30 [2018-11-28 10:53:02,802 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:02,813 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:02,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-28 10:53:02,870 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:476, output treesize:388 [2018-11-28 10:53:03,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 92 treesize of output 125 [2018-11-28 10:53:03,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:03,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 54 treesize of output 79 [2018-11-28 10:53:03,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:03,240 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 2 xjuncts. [2018-11-28 10:53:03,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:155, output treesize:125 [2018-11-28 10:53:03,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 108 [2018-11-28 10:53:03,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,385 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 128 [2018-11-28 10:53:03,388 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 10:53:03,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:03,499 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 76 [2018-11-28 10:53:03,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:03,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:03,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-11-28 10:53:03,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-11-28 10:53:03,791 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:151, output treesize:377 [2018-11-28 10:53:10,007 WARN L180 SmtUtils]: Spent 6.05 s on a formula simplification. DAG size of input: 109 DAG size of output: 50 [2018-11-28 10:53:10,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:10,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:10,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 65 [2018-11-28 10:53:10,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:10,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-11-28 10:53:10,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:10,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 10:53:10,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:10,054 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 19 treesize of output 10 [2018-11-28 10:53:10,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:10,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:10,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:10,079 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 50 [2018-11-28 10:53:10,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:10,081 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 12 [2018-11-28 10:53:10,082 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:10,090 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:10,090 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 20 treesize of output 15 [2018-11-28 10:53:10,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:10,095 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:10,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-11-28 10:53:10,107 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:136, output treesize:42 [2018-11-28 10:53:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:53:10,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:53:10,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2018-11-28 10:53:10,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-28 10:53:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-28 10:53:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2888, Unknown=9, NotChecked=0, Total=3080 [2018-11-28 10:53:10,221 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand 56 states. [2018-11-28 10:53:28,335 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 65 [2018-11-28 10:53:32,684 WARN L180 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-11-28 10:53:33,871 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-11-28 10:53:34,385 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2018-11-28 10:53:36,713 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 50 [2018-11-28 10:53:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:53:39,782 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-28 10:53:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-28 10:53:39,783 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 54 [2018-11-28 10:53:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:53:39,784 INFO L225 Difference]: With dead ends: 128 [2018-11-28 10:53:39,784 INFO L226 Difference]: Without dead ends: 128 [2018-11-28 10:53:39,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2199 ImplicationChecksByTransitivity, 27.1s TimeCoverageRelationStatistics Valid=597, Invalid=7766, Unknown=9, NotChecked=0, Total=8372 [2018-11-28 10:53:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-28 10:53:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2018-11-28 10:53:39,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-28 10:53:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-11-28 10:53:39,790 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 54 [2018-11-28 10:53:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:53:39,790 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-11-28 10:53:39,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-28 10:53:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-28 10:53:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 10:53:39,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:53:39,791 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:53:39,791 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:53:39,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:53:39,792 INFO L82 PathProgramCache]: Analyzing trace with hash 344337646, now seen corresponding path program 1 times [2018-11-28 10:53:39,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:53:39,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:53:39,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:53:39,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:53:39,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:53:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:53:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:53:40,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:53:40,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:53:40,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:53:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:53:40,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:53:40,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:53:40,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:53:40,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:40,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:40,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:40,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 10:53:40,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:53:40,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:53:40,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:40,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:40,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:40,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-11-28 10:53:40,750 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 23 treesize of output 18 [2018-11-28 10:53:40,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:40,755 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 18 treesize of output 25 [2018-11-28 10:53:40,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:40,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:40,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:40,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:39 [2018-11-28 10:53:42,030 WARN L180 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 10:53:42,052 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 21 treesize of output 33 [2018-11-28 10:53:42,055 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 22 treesize of output 21 [2018-11-28 10:53:42,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:42,085 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2018-11-28 10:53:42,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 10:53:42,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 10:53:42,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 10:53:42,124 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:62, output treesize:109 [2018-11-28 10:53:44,358 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 42 [2018-11-28 10:53:44,432 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 0 case distinctions, treesize of input 79 treesize of output 63 [2018-11-28 10:53:44,434 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-28 10:53:44,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:44,440 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 30 treesize of output 42 [2018-11-28 10:53:44,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,450 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,461 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:53:44,462 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 38 treesize of output 35 [2018-11-28 10:53:44,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:44,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-11-28 10:53:44,467 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,473 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,488 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 0 case distinctions, treesize of input 66 treesize of output 62 [2018-11-28 10:53:44,490 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-11-28 10:53:44,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:44,497 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 26 treesize of output 39 [2018-11-28 10:53:44,497 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,505 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,522 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:53:44,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-11-28 10:53:44,526 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 29 treesize of output 22 [2018-11-28 10:53:44,527 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,533 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,542 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,571 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 44 treesize of output 37 [2018-11-28 10:53:44,573 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 10:53:44,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:44,577 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 17 treesize of output 23 [2018-11-28 10:53:44,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-11-28 10:53:44,582 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,586 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,591 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,598 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:44,616 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 2 xjuncts. [2018-11-28 10:53:44,617 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:126, output treesize:59 [2018-11-28 10:53:45,063 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 75 treesize of output 74 [2018-11-28 10:53:45,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,094 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 63 treesize of output 62 [2018-11-28 10:53:45,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,120 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 2 xjuncts. [2018-11-28 10:53:45,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:137 [2018-11-28 10:53:45,207 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:53:45,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,210 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:45,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:53:45,212 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 95 treesize of output 89 [2018-11-28 10:53:45,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,260 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 0 case distinctions, treesize of input 79 treesize of output 67 [2018-11-28 10:53:45,264 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 66 treesize of output 55 [2018-11-28 10:53:45,265 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:45,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:45,287 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:53:45,289 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2018-11-28 10:53:45,291 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 44 treesize of output 33 [2018-11-28 10:53:45,292 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,298 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:53:45,307 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:179, output treesize:46 [2018-11-28 10:53:45,364 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 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 10:53:45,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 10:53:45,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 10:53:45,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,382 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 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 10:53:45,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 10:53:45,384 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 10:53:45,389 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:53:45,395 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:9 [2018-11-28 10:53:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:53:45,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 10:53:45,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [19] total 39 [2018-11-28 10:53:45,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-28 10:53:45,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-28 10:53:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1435, Unknown=1, NotChecked=0, Total=1560 [2018-11-28 10:53:45,462 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 40 states. [2018-11-28 10:53:49,920 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-11-28 10:53:51,621 WARN L180 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2018-11-28 10:54:02,676 WARN L180 SmtUtils]: Spent 9.45 s on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2018-11-28 10:54:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:54:07,762 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2018-11-28 10:54:07,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-28 10:54:07,763 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 54 [2018-11-28 10:54:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:54:07,763 INFO L225 Difference]: With dead ends: 126 [2018-11-28 10:54:07,763 INFO L226 Difference]: Without dead ends: 126 [2018-11-28 10:54:07,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=402, Invalid=4015, Unknown=5, NotChecked=0, Total=4422 [2018-11-28 10:54:07,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-28 10:54:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 103. [2018-11-28 10:54:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-28 10:54:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2018-11-28 10:54:07,767 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 54 [2018-11-28 10:54:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:54:07,768 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2018-11-28 10:54:07,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-28 10:54:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2018-11-28 10:54:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 10:54:07,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:54:07,784 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:54:07,785 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:54:07,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:54:07,785 INFO L82 PathProgramCache]: Analyzing trace with hash -626068770, now seen corresponding path program 1 times [2018-11-28 10:54:07,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:54:07,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:54:07,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:54:07,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:54:07,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:54:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:54:08,190 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:54:08,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:54:08,190 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:54:08,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:54:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:54:08,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:54:08,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:54:08,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:54:08,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:08,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:08,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:08,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-28 10:54:10,375 WARN L180 SmtUtils]: Spent 516.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 10:54:10,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:54:10,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:54:10,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:10,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:10,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:54:10,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:67 [2018-11-28 10:54:11,095 WARN L180 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 10:54:11,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:11,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:11,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:54:11,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,143 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 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-28 10:54:11,145 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-11-28 10:54:11,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:11,149 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 26 treesize of output 39 [2018-11-28 10:54:11,150 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,168 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:54:11,169 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-11-28 10:54:11,171 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 29 treesize of output 22 [2018-11-28 10:54:11,171 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,181 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,186 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,194 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:82, output treesize:30 [2018-11-28 10:54:11,337 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 35 treesize of output 29 [2018-11-28 10:54:11,340 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 29 treesize of output 23 [2018-11-28 10:54:11,341 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:54:11,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:54:11,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:54:11,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:33 [2018-11-28 10:54:11,440 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:54:11,442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2018-11-28 10:54:11,444 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 31 treesize of output 22 [2018-11-28 10:54:11,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:54:11,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-11-28 10:54:11,490 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 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 10:54:11,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 10:54:11,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 10:54:11,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:11,502 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-11-28 10:54:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:54:11,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:54:11,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 32 [2018-11-28 10:54:11,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-28 10:54:11,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-28 10:54:11,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=926, Unknown=3, NotChecked=0, Total=1056 [2018-11-28 10:54:11,545 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand 33 states. [2018-11-28 10:54:19,383 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-11-28 10:54:25,543 WARN L180 SmtUtils]: Spent 615.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 10:54:25,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:54:25,996 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-11-28 10:54:25,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 10:54:25,997 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 58 [2018-11-28 10:54:25,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:54:25,997 INFO L225 Difference]: With dead ends: 122 [2018-11-28 10:54:25,998 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 10:54:25,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=317, Invalid=2329, Unknown=6, NotChecked=0, Total=2652 [2018-11-28 10:54:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 10:54:26,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2018-11-28 10:54:26,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-28 10:54:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2018-11-28 10:54:26,002 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 58 [2018-11-28 10:54:26,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:54:26,002 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2018-11-28 10:54:26,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-28 10:54:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2018-11-28 10:54:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 10:54:26,003 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:54:26,003 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:54:26,003 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:54:26,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:54:26,003 INFO L82 PathProgramCache]: Analyzing trace with hash -626080717, now seen corresponding path program 1 times [2018-11-28 10:54:26,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:54:26,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:54:26,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:54:26,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:54:26,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:54:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:54:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 10:54:26,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:54:26,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:54:26,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:54:26,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:54:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:54:26,041 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand 5 states. [2018-11-28 10:54:26,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:54:26,149 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-11-28 10:54:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:54:26,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-28 10:54:26,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:54:26,151 INFO L225 Difference]: With dead ends: 116 [2018-11-28 10:54:26,151 INFO L226 Difference]: Without dead ends: 116 [2018-11-28 10:54:26,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:54:26,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-28 10:54:26,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2018-11-28 10:54:26,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-28 10:54:26,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-11-28 10:54:26,157 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 58 [2018-11-28 10:54:26,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:54:26,157 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-11-28 10:54:26,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:54:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-11-28 10:54:26,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 10:54:26,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:54:26,158 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:54:26,158 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:54:26,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:54:26,159 INFO L82 PathProgramCache]: Analyzing trace with hash -626080716, now seen corresponding path program 1 times [2018-11-28 10:54:26,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:54:26,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:54:26,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:54:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:54:26,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:54:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:54:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:54:26,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:54:26,855 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:54:26,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:54:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:54:26,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:54:26,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:54:26,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:54:26,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:26,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:26,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:26,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 10:54:27,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:54:27,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:54:27,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:27,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:27,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:27,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:25 [2018-11-28 10:54:27,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 29 treesize of output 24 [2018-11-28 10:54:27,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:27,237 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 24 treesize of output 31 [2018-11-28 10:54:27,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:27,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:27,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:54:27,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:45 [2018-11-28 10:54:28,472 WARN L180 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-28 10:54:28,497 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 27 treesize of output 39 [2018-11-28 10:54:28,500 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 28 treesize of output 27 [2018-11-28 10:54:28,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:28,533 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2018-11-28 10:54:28,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 10:54:28,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 10:54:28,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 10:54:28,573 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:68, output treesize:121 [2018-11-28 10:54:30,946 WARN L180 SmtUtils]: Spent 2.29 s on a formula simplification that was a NOOP. DAG size: 44 [2018-11-28 10:54:31,007 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 50 treesize of output 41 [2018-11-28 10:54:31,010 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-11-28 10:54:31,012 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:31,013 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 17 treesize of output 23 [2018-11-28 10:54:31,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2018-11-28 10:54:31,017 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,026 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,082 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 0 case distinctions, treesize of input 85 treesize of output 67 [2018-11-28 10:54:31,085 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 48 [2018-11-28 10:54:31,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:31,089 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 30 treesize of output 42 [2018-11-28 10:54:31,089 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,097 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,107 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:54:31,107 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 38 treesize of output 35 [2018-11-28 10:54:31,110 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:31,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-11-28 10:54:31,112 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,117 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,124 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,129 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 0 case distinctions, treesize of input 72 treesize of output 68 [2018-11-28 10:54:31,132 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-11-28 10:54:31,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:31,136 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 26 treesize of output 39 [2018-11-28 10:54:31,136 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,141 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,155 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:54:31,155 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 65 [2018-11-28 10:54:31,158 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 46 treesize of output 37 [2018-11-28 10:54:31,158 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,165 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,173 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,193 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 2 xjuncts. [2018-11-28 10:54:31,194 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:138, output treesize:63 [2018-11-28 10:54:31,620 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 77 treesize of output 76 [2018-11-28 10:54:31,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,650 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 65 treesize of output 64 [2018-11-28 10:54:31,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,673 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 2 xjuncts. [2018-11-28 10:54:31,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:143, output treesize:141 [2018-11-28 10:54:31,755 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:54:31,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:31,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:31,759 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 97 treesize of output 91 [2018-11-28 10:54:31,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,798 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 0 case distinctions, treesize of input 81 treesize of output 69 [2018-11-28 10:54:31,801 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 68 treesize of output 57 [2018-11-28 10:54:31,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:54:31,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:54:31,821 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:54:31,822 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 55 [2018-11-28 10:54:31,824 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 44 treesize of output 33 [2018-11-28 10:54:31,825 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,830 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:54:31,837 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:183, output treesize:48 [2018-11-28 10:54:31,988 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 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-28 10:54:31,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 10:54:31,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 10:54:31,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:31,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:32,004 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 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 10:54:32,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 10:54:32,008 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:32,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 10:54:32,013 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:32,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:32,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:32,018 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:9 [2018-11-28 10:54:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:54:32,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 10:54:32,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [21] total 42 [2018-11-28 10:54:32,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-28 10:54:32,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-28 10:54:32,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1667, Unknown=1, NotChecked=0, Total=1806 [2018-11-28 10:54:32,077 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 43 states. [2018-11-28 10:54:36,656 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2018-11-28 10:54:38,462 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-11-28 10:54:41,846 WARN L180 SmtUtils]: Spent 3.33 s on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-11-28 10:54:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:54:45,792 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2018-11-28 10:54:45,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 10:54:45,792 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 58 [2018-11-28 10:54:45,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:54:45,793 INFO L225 Difference]: With dead ends: 122 [2018-11-28 10:54:45,793 INFO L226 Difference]: Without dead ends: 122 [2018-11-28 10:54:45,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=436, Invalid=4529, Unknown=5, NotChecked=0, Total=4970 [2018-11-28 10:54:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-28 10:54:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 111. [2018-11-28 10:54:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-28 10:54:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2018-11-28 10:54:45,796 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 58 [2018-11-28 10:54:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:54:45,797 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2018-11-28 10:54:45,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-28 10:54:45,797 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2018-11-28 10:54:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 10:54:45,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:54:45,797 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:54:45,798 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:54:45,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:54:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2066704733, now seen corresponding path program 1 times [2018-11-28 10:54:45,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:54:45,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:54:45,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:54:45,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:54:45,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:54:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:54:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-28 10:54:45,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:54:45,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:54:45,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 10:54:45,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:54:45,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:54:45,848 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 5 states. [2018-11-28 10:54:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:54:45,951 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2018-11-28 10:54:45,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 10:54:45,951 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-11-28 10:54:45,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:54:45,952 INFO L225 Difference]: With dead ends: 115 [2018-11-28 10:54:45,952 INFO L226 Difference]: Without dead ends: 115 [2018-11-28 10:54:45,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:54:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-28 10:54:45,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-11-28 10:54:45,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-28 10:54:45,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2018-11-28 10:54:45,955 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 59 [2018-11-28 10:54:45,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:54:45,956 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-11-28 10:54:45,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 10:54:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2018-11-28 10:54:45,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 10:54:45,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:54:45,956 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:54:45,958 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:54:45,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:54:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2066334302, now seen corresponding path program 1 times [2018-11-28 10:54:45,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:54:45,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:54:45,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:54:45,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:54:45,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:54:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:54:47,088 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:54:47,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:54:47,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:54:47,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:54:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:54:47,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:54:47,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 10:54:47,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:54:47,186 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 13 treesize of output 10 [2018-11-28 10:54:47,187 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 10 treesize of output 9 [2018-11-28 10:54:47,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-28 10:54:47,247 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 19 treesize of output 31 [2018-11-28 10:54:47,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 20 treesize of output 19 [2018-11-28 10:54:47,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:54:47,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:54:47,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,286 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:37 [2018-11-28 10:54:47,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:47,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:54:47,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:54:47,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:54:47,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:39 [2018-11-28 10:54:55,328 WARN L180 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 10:55:11,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:11,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:11,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:55:11,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,708 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 0 case distinctions, treesize of input 67 treesize of output 55 [2018-11-28 10:55:11,711 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-28 10:55:11,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:11,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2018-11-28 10:55:11,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:11,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-28 10:55:11,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:11,756 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-11-28 10:55:11,757 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:55:11,764 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:55:11,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:55:11,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2018-11-28 10:55:11,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 10:55:11,793 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 18 treesize of output 19 [2018-11-28 10:55:11,793 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,803 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:11,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:11,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2018-11-28 10:55:11,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 43 [2018-11-28 10:55:11,839 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,852 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,865 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,924 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:55:11,924 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2018-11-28 10:55:11,934 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2018-11-28 10:55:11,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:11,938 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 30 treesize of output 42 [2018-11-28 10:55:11,938 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,945 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,961 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:55:11,963 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2018-11-28 10:55:11,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:11,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2018-11-28 10:55:11,968 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,975 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,984 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:11,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 83 [2018-11-28 10:55:11,995 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 26 [2018-11-28 10:55:11,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:12,000 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 26 treesize of output 39 [2018-11-28 10:55:12,000 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,005 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,022 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:12,026 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:55:12,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2018-11-28 10:55:12,031 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 29 treesize of output 22 [2018-11-28 10:55:12,031 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,042 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,053 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 10:55:12,078 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:126, output treesize:99 [2018-11-28 10:55:12,647 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 105 treesize of output 104 [2018-11-28 10:55:12,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,680 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 69 treesize of output 68 [2018-11-28 10:55:12,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,710 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 2 xjuncts. [2018-11-28 10:55:12,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:175, output treesize:173 [2018-11-28 10:55:12,806 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 10:55:12,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:12,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:12,812 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 125 treesize of output 119 [2018-11-28 10:55:12,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:12,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:12,833 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:12,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 107 [2018-11-28 10:55:12,850 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 112 [2018-11-28 10:55:12,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 10:55:12,912 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 10:55:12,975 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:55:12,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 82 [2018-11-28 10:55:12,980 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 44 treesize of output 33 [2018-11-28 10:55:12,981 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,990 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:12,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:12,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:12,996 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:55:12,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 104 [2018-11-28 10:55:13,002 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 54 treesize of output 41 [2018-11-28 10:55:13,002 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,015 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,017 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:13,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:55:13,022 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 10:55:13,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 152 [2018-11-28 10:55:13,029 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 74 treesize of output 61 [2018-11-28 10:55:13,029 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,042 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-28 10:55:13,149 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:215, output treesize:241 [2018-11-28 10:55:13,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2018-11-28 10:55:13,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 10:55:13,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 27 treesize of output 16 [2018-11-28 10:55:13,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 10:55:13,426 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:75, output treesize:45 [2018-11-28 10:55:13,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 39 [2018-11-28 10:55:13,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 10:55:13,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,502 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 5 [2018-11-28 10:55:13,502 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 10:55:13,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:55:13,516 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:3 [2018-11-28 10:55:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:55:13,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:55:13,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 46 [2018-11-28 10:55:13,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-28 10:55:13,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-28 10:55:13,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1992, Unknown=15, NotChecked=0, Total=2162 [2018-11-28 10:55:13,569 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 47 states. [2018-11-28 10:55:38,936 WARN L180 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-11-28 10:55:41,876 WARN L180 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2018-11-28 10:55:48,156 WARN L180 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-28 10:56:05,328 WARN L180 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2018-11-28 10:56:09,513 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-11-28 10:56:11,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:56:11,950 INFO L93 Difference]: Finished difference Result 192 states and 203 transitions. [2018-11-28 10:56:11,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-28 10:56:11,950 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 59 [2018-11-28 10:56:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:56:11,951 INFO L225 Difference]: With dead ends: 192 [2018-11-28 10:56:11,951 INFO L226 Difference]: Without dead ends: 192 [2018-11-28 10:56:11,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 48.7s TimeCoverageRelationStatistics Valid=473, Invalid=5059, Unknown=18, NotChecked=0, Total=5550 [2018-11-28 10:56:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-28 10:56:11,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 119. [2018-11-28 10:56:11,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-28 10:56:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-11-28 10:56:11,956 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 59 [2018-11-28 10:56:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:56:11,956 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-11-28 10:56:11,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-28 10:56:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-11-28 10:56:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 10:56:11,957 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:56:11,957 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:56:11,958 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:56:11,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:56:11,958 INFO L82 PathProgramCache]: Analyzing trace with hash -356662591, now seen corresponding path program 1 times [2018-11-28 10:56:11,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:56:11,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:56:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:56:11,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:56:11,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:56:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:56:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:56:12,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:56:12,443 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:56:12,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:56:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:56:12,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:56:12,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 10:56:12,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:56:12,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:12,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-28 10:56:12,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 10:56:12,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 10:56:12,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:56:12,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:12,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:12,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-11-28 10:56:12,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:56:12,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:56:12,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-11-28 10:56:12,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:56:12,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:12,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-11-28 10:56:15,273 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 10:56:26,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:56:26,914 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:56:26,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 10:56:26,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:56:26,928 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 0 case distinctions, treesize of input 35 treesize of output 39 [2018-11-28 10:56:26,930 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 10:56:26,933 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 18 treesize of output 19 [2018-11-28 10:56:26,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 10:56:26,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:26,951 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 35 [2018-11-28 10:56:26,954 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 24 treesize of output 16 [2018-11-28 10:56:26,955 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 10:56:26,960 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:26,964 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:26,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:26,970 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:16 [2018-11-28 10:56:27,090 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 23 treesize of output 19 [2018-11-28 10:56:27,091 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 19 treesize of output 11 [2018-11-28 10:56:27,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:56:27,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:27,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:27,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2018-11-28 10:56:27,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:56:27,164 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 0 case distinctions, treesize of input 32 treesize of output 32 [2018-11-28 10:56:27,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-28 10:56:27,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:56:27,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:56:27,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:56:27,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:32 [2018-11-28 10:56:27,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-28 10:56:27,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 10:56:27,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 10:56:27,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-28 10:56:27,232 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 10:56:27,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:27,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 10:56:27,238 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:10 [2018-11-28 10:56:27,241 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 10:56:27,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-11-28 10:56:27,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 10:56:27,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 10:56:27,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-11-28 10:56:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:56:27,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:56:27,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 39 [2018-11-28 10:56:27,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-28 10:56:27,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-28 10:56:27,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1407, Unknown=11, NotChecked=0, Total=1560 [2018-11-28 10:56:27,310 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 40 states. [2018-11-28 10:56:45,969 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-11-28 10:56:52,008 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-11-28 10:57:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:57:03,056 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-11-28 10:57:03,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 10:57:03,056 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 60 [2018-11-28 10:57:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 10:57:03,058 INFO L225 Difference]: With dead ends: 168 [2018-11-28 10:57:03,058 INFO L226 Difference]: Without dead ends: 168 [2018-11-28 10:57:03,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=413, Invalid=3235, Unknown=12, NotChecked=0, Total=3660 [2018-11-28 10:57:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-28 10:57:03,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 122. [2018-11-28 10:57:03,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 10:57:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2018-11-28 10:57:03,064 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 60 [2018-11-28 10:57:03,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 10:57:03,064 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2018-11-28 10:57:03,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-28 10:57:03,064 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2018-11-28 10:57:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-28 10:57:03,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 10:57:03,065 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:57:03,065 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr32ASSERT_VIOLATIONMEMORY_FREE, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr33ASSERT_VIOLATIONMEMORY_FREE, mainErr36ENSURES_VIOLATIONMEMORY_LEAK, mainErr18REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr30REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION]=== [2018-11-28 10:57:03,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:57:03,065 INFO L82 PathProgramCache]: Analyzing trace with hash -368145965, now seen corresponding path program 1 times [2018-11-28 10:57:03,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:57:03,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:57:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:03,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:57:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:57:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:57:03,121 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 10:57:03,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 10:57:03 BoogieIcfgContainer [2018-11-28 10:57:03,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 10:57:03,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:57:03,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:57:03,160 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:57:03,161 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:30" (3/4) ... [2018-11-28 10:57:03,163 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 10:57:03,201 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3aa0b57f-a6a4-40fc-ad13-5fe20e4b52a2/bin-2019/uautomizer/witness.graphml [2018-11-28 10:57:03,201 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:57:03,202 INFO L168 Benchmark]: Toolchain (without parser) took 513315.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -288.8 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:57:03,202 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:57:03,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -204.6 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-11-28 10:57:03,203 INFO L168 Benchmark]: Boogie Preprocessor took 37.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-28 10:57:03,203 INFO L168 Benchmark]: RCFGBuilder took 452.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 63.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 11.5 GB. [2018-11-28 10:57:03,203 INFO L168 Benchmark]: TraceAbstraction took 512443.42 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.2 GB in the end (delta: -159.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:57:03,204 INFO L168 Benchmark]: Witness Printer took 41.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-28 10:57:03,205 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -204.6 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 452.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 63.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 512443.42 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.2 GB in the end (delta: -159.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 41.54 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 648]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L635] struct item *list = ((void *)0); VAL [list={10:0}] [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={0:0}, item={11:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={11:0}, item->next={0:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={11:0}, malloc(sizeof *item)={14:0}, malloc(sizeof *item)={11:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND TRUE __VERIFIER_nondet_int() [L637] CALL append(&list) VAL [plist={10:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L627] EXPR \read(**plist) VAL [\read(**plist)={11:0}, item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L627] item->next = *plist VAL [\read(**plist)={11:0}, item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628] EXPR item->next VAL [item={12:0}, item->next={11:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [item={12:0}, item->next={11:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L629] EXPR item->next VAL [item={12:0}, item->next={11:0}, item->next={11:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L629] EXPR item->next->data VAL [item={12:0}, item->next={11:0}, item->next={11:0}, item->next->data={14:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={12:0}, item->next={11:0}, item->next={11:0}, item->next->data={14:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L628-L630] item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={14:0}, item={12:0}, item->next={11:0}, item->next={11:0}, item->next->data={14:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L631] *plist = item VAL [item={12:0}, malloc(sizeof *item)={12:0}, plist={10:0}, plist={10:0}] [L637] RET append(&list) VAL [list={10:0}] [L638] COND FALSE !(__VERIFIER_nondet_int()) [L639] \read(*list) VAL [\read(*list)={12:0}, list={10:0}] [L639] COND TRUE \read(*list) [L640] EXPR \read(*list) VAL [\read(*list)={12:0}, list={10:0}] [L640] EXPR list->next VAL [\read(*list)={12:0}, list={10:0}, list->next={11:0}] [L640] struct item *next = list->next; [L641] EXPR \read(*list) VAL [\read(*list)={12:0}, list={10:0}, next={11:0}] [L641] EXPR list->data VAL [\read(*list)={12:0}, list={10:0}, list->data={14:0}, next={11:0}] [L641] free(list->data) VAL [\read(*list)={12:0}, list={10:0}, list->data={14:0}, next={11:0}] [L641] free(list->data) [L642] EXPR \read(*list) VAL [\read(*list)={12:0}, list={10:0}, next={11:0}] [L642] free(list) VAL [\read(*list)={12:0}, list={10:0}, next={11:0}] [L642] free(list) [L643] list = next VAL [list={10:0}, next={11:0}] [L645] \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={11:0}] [L645] COND TRUE \read(*list) [L646] EXPR \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={11:0}] [L646] EXPR list->next VAL [\read(*list)={11:0}, list={10:0}, list->next={0:0}, next={11:0}] [L646] struct item *next = list->next; [L647] COND TRUE !next VAL [list={10:0}, next={0:0}, next={11:0}] [L648] EXPR \read(*list) VAL [\read(*list)={11:0}, list={10:0}, next={11:0}, next={0:0}] [L648] EXPR list->data VAL [\read(*list)={11:0}, list={10:0}, list->data={14:0}, next={11:0}, next={0:0}] [L648] free(list->data) VAL [\read(*list)={11:0}, list={10:0}, list->data={14:0}, next={0:0}, next={11:0}] [L648] free(list->data) VAL [\read(*list)={11:0}, list={10:0}, list->data={14:0}, next={0:0}, next={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 106 locations, 51 error locations. UNSAFE Result, 512.4s OverallTime, 39 OverallIterations, 2 TraceHistogramMax, 366.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1895 SDtfs, 4547 SDslu, 12147 SDs, 0 SdLazy, 20165 SolverSat, 966 SolverUnsat, 152 SolverUnknown, 0 SolverNotchecked, 204.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1601 GetRequests, 512 SyntacticMatches, 56 SemanticMatches, 1033 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13547 ImplicationChecksByTransitivity, 294.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=38, 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, 38 MinimizatonAttempts, 517 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 143.6s InterpolantComputationTime, 2137 NumberOfCodeBlocks, 2137 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 2024 ConstructedInterpolants, 178 QuantifiedInterpolants, 2402398 SizeOfPredicates, 366 NumberOfNonLiveVariables, 4138 ConjunctsInSsa, 1065 ConjunctsInUnsatCore, 53 InterpolantComputations, 25 PerfectInterpolantSequences, 195/420 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...