./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3aee1e8d9b723b18f218b6c1185554e637930c5d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 20:00:51,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 20:00:51,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 20:00:51,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 20:00:51,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 20:00:51,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 20:00:51,374 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 20:00:51,376 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 20:00:51,378 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 20:00:51,379 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 20:00:51,380 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 20:00:51,380 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 20:00:51,381 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 20:00:51,382 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 20:00:51,384 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 20:00:51,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 20:00:51,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 20:00:51,387 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 20:00:51,389 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 20:00:51,391 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 20:00:51,392 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 20:00:51,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 20:00:51,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 20:00:51,397 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 20:00:51,397 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 20:00:51,398 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 20:00:51,399 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 20:00:51,400 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 20:00:51,401 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 20:00:51,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 20:00:51,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 20:00:51,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 20:00:51,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 20:00:51,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 20:00:51,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 20:00:51,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 20:00:51,406 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 20:00:51,434 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 20:00:51,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 20:00:51,437 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 20:00:51,438 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 20:00:51,439 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 20:00:51,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 20:00:51,439 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 20:00:51,439 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 20:00:51,439 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 20:00:51,439 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 20:00:51,440 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 20:00:51,440 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 20:00:51,440 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 20:00:51,440 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 20:00:51,440 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 20:00:51,441 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 20:00:51,443 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 20:00:51,443 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 20:00:51,443 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 20:00:51,444 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 20:00:51,444 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:00:51,444 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 20:00:51,444 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 20:00:51,444 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 20:00:51,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 20:00:51,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3aee1e8d9b723b18f218b6c1185554e637930c5d [2019-01-14 20:00:51,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 20:00:51,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 20:00:51,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 20:00:51,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 20:00:51,542 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 20:00:51,543 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-14 20:00:51,604 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb06dec8/75c7506a53f446ff9f990dd6b8fea737/FLAG670e9553f [2019-01-14 20:00:52,176 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 20:00:52,177 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/forester-heap/sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-14 20:00:52,193 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb06dec8/75c7506a53f446ff9f990dd6b8fea737/FLAG670e9553f [2019-01-14 20:00:52,407 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb06dec8/75c7506a53f446ff9f990dd6b8fea737 [2019-01-14 20:00:52,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 20:00:52,411 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 20:00:52,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 20:00:52,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 20:00:52,415 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 20:00:52,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:00:52" (1/1) ... [2019-01-14 20:00:52,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12bfca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:52, skipping insertion in model container [2019-01-14 20:00:52,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:00:52" (1/1) ... [2019-01-14 20:00:52,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 20:00:52,484 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 20:00:52,824 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:00:52,835 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 20:00:52,954 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:00:53,012 INFO L195 MainTranslator]: Completed translation [2019-01-14 20:00:53,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:53 WrapperNode [2019-01-14 20:00:53,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 20:00:53,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 20:00:53,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 20:00:53,014 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 20:00:53,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:53" (1/1) ... [2019-01-14 20:00:53,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:53" (1/1) ... [2019-01-14 20:00:53,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:53" (1/1) ... [2019-01-14 20:00:53,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:53" (1/1) ... [2019-01-14 20:00:53,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:53" (1/1) ... [2019-01-14 20:00:53,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:53" (1/1) ... [2019-01-14 20:00:53,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:53" (1/1) ... [2019-01-14 20:00:53,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 20:00:53,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 20:00:53,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 20:00:53,111 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 20:00:53,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:00:53,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 20:00:53,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 20:00:53,165 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 20:00:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 20:00:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 20:00:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 20:00:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 20:00:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 20:00:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 20:00:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 20:00:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 20:00:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 20:00:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 20:00:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 20:00:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 20:00:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 20:00:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 20:00:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 20:00:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 20:00:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 20:00:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 20:00:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 20:00:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 20:00:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 20:00:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 20:00:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 20:00:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 20:00:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 20:00:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 20:00:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 20:00:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 20:00:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 20:00:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 20:00:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 20:00:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 20:00:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 20:00:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 20:00:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 20:00:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 20:00:53,171 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 20:00:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 20:00:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 20:00:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 20:00:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 20:00:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 20:00:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 20:00:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 20:00:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 20:00:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 20:00:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 20:00:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 20:00:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 20:00:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 20:00:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 20:00:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 20:00:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 20:00:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 20:00:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 20:00:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 20:00:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 20:00:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 20:00:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-14 20:00:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 20:00:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 20:00:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-14 20:00:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 20:00:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 20:00:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-14 20:00:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 20:00:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 20:00:53,175 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 20:00:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 20:00:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 20:00:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 20:00:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 20:00:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 20:00:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 20:00:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 20:00:53,176 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 20:00:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 20:00:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 20:00:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 20:00:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 20:00:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 20:00:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 20:00:53,177 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 20:00:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 20:00:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 20:00:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 20:00:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 20:00:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 20:00:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 20:00:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 20:00:53,178 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 20:00:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 20:00:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 20:00:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 20:00:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 20:00:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 20:00:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 20:00:53,179 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 20:00:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 20:00:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 20:00:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 20:00:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 20:00:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 20:00:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 20:00:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 20:00:53,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 20:00:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 20:00:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 20:00:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 20:00:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 20:00:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 20:00:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 20:00:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 20:00:53,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 20:00:54,248 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 20:00:54,248 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-14 20:00:54,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:00:54 BoogieIcfgContainer [2019-01-14 20:00:54,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 20:00:54,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 20:00:54,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 20:00:54,254 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 20:00:54,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 08:00:52" (1/3) ... [2019-01-14 20:00:54,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116ad799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:00:54, skipping insertion in model container [2019-01-14 20:00:54,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:00:53" (2/3) ... [2019-01-14 20:00:54,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@116ad799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:00:54, skipping insertion in model container [2019-01-14 20:00:54,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:00:54" (3/3) ... [2019-01-14 20:00:54,258 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1_false-unreach-call_false-valid-deref.i [2019-01-14 20:00:54,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 20:00:54,277 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2019-01-14 20:00:54,295 INFO L257 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2019-01-14 20:00:54,320 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 20:00:54,321 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 20:00:54,321 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 20:00:54,321 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 20:00:54,321 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 20:00:54,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 20:00:54,322 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 20:00:54,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 20:00:54,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 20:00:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2019-01-14 20:00:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 20:00:54,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:00:54,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:00:54,355 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:00:54,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:00:54,361 INFO L82 PathProgramCache]: Analyzing trace with hash -250439764, now seen corresponding path program 1 times [2019-01-14 20:00:54,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:00:54,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:00:54,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:54,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:00:54,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:00:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:00:54,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:00:54,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:00:54,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:00:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:00:54,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:00:54,546 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 3 states. [2019-01-14 20:00:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:00:55,164 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-01-14 20:00:55,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:00:55,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-14 20:00:55,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:00:55,179 INFO L225 Difference]: With dead ends: 119 [2019-01-14 20:00:55,179 INFO L226 Difference]: Without dead ends: 115 [2019-01-14 20:00:55,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:00:55,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-14 20:00:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2019-01-14 20:00:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 20:00:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2019-01-14 20:00:55,230 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 7 [2019-01-14 20:00:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:00:55,230 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2019-01-14 20:00:55,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:00:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2019-01-14 20:00:55,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 20:00:55,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:00:55,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:00:55,232 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:00:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:00:55,232 INFO L82 PathProgramCache]: Analyzing trace with hash -250439763, now seen corresponding path program 1 times [2019-01-14 20:00:55,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:00:55,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:00:55,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:55,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:00:55,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:00:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:00:55,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:00:55,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:00:55,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:00:55,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:00:55,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:00:55,314 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand 3 states. [2019-01-14 20:00:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:00:55,593 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-01-14 20:00:55,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:00:55,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-14 20:00:55,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:00:55,596 INFO L225 Difference]: With dead ends: 129 [2019-01-14 20:00:55,596 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 20:00:55,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:00:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 20:00:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2019-01-14 20:00:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 20:00:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-01-14 20:00:55,609 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2019-01-14 20:00:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:00:55,610 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-01-14 20:00:55,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:00:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-01-14 20:00:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:00:55,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:00:55,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:00:55,612 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:00:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:00:55,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1172744574, now seen corresponding path program 1 times [2019-01-14 20:00:55,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:00:55,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:00:55,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:55,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:00:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:00:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:00:55,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:00:55,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 20:00:55,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 20:00:55,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 20:00:55,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 20:00:55,712 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 4 states. [2019-01-14 20:00:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:00:56,134 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-01-14 20:00:56,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:00:56,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 20:00:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:00:56,137 INFO L225 Difference]: With dead ends: 123 [2019-01-14 20:00:56,137 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 20:00:56,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:00:56,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 20:00:56,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2019-01-14 20:00:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 20:00:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-01-14 20:00:56,147 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 12 [2019-01-14 20:00:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:00:56,147 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-01-14 20:00:56,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 20:00:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-01-14 20:00:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:00:56,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:00:56,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:00:56,149 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:00:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:00:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1172744573, now seen corresponding path program 1 times [2019-01-14 20:00:56,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:00:56,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:00:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:56,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:00:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:00:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:00:56,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:00:56,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 20:00:56,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:00:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:00:56,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:00:56,388 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 7 states. [2019-01-14 20:00:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:00:56,814 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-01-14 20:00:56,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:00:56,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-14 20:00:56,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:00:56,817 INFO L225 Difference]: With dead ends: 140 [2019-01-14 20:00:56,817 INFO L226 Difference]: Without dead ends: 140 [2019-01-14 20:00:56,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:00:56,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-14 20:00:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2019-01-14 20:00:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 20:00:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2019-01-14 20:00:56,836 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 12 [2019-01-14 20:00:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:00:56,837 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2019-01-14 20:00:56,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:00:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2019-01-14 20:00:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 20:00:56,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:00:56,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:00:56,838 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:00:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:00:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1969625224, now seen corresponding path program 1 times [2019-01-14 20:00:56,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:00:56,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:00:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:56,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:00:56,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:56,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:00:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:00:56,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:00:56,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:00:56,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:00:56,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:00:56,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:00:56,964 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 6 states. [2019-01-14 20:00:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:00:57,566 INFO L93 Difference]: Finished difference Result 191 states and 208 transitions. [2019-01-14 20:00:57,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:00:57,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-14 20:00:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:00:57,569 INFO L225 Difference]: With dead ends: 191 [2019-01-14 20:00:57,569 INFO L226 Difference]: Without dead ends: 191 [2019-01-14 20:00:57,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:00:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-14 20:00:57,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 116. [2019-01-14 20:00:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-14 20:00:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2019-01-14 20:00:57,581 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 127 transitions. Word has length 15 [2019-01-14 20:00:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:00:57,582 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 127 transitions. [2019-01-14 20:00:57,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:00:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 127 transitions. [2019-01-14 20:00:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 20:00:57,582 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:00:57,582 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:00:57,583 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:00:57,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:00:57,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1969625223, now seen corresponding path program 1 times [2019-01-14 20:00:57,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:00:57,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:00:57,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:57,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:00:57,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:00:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:00:57,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:00:57,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:00:57,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:00:57,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:00:57,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:00:57,699 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. Second operand 6 states. [2019-01-14 20:00:58,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:00:58,233 INFO L93 Difference]: Finished difference Result 194 states and 214 transitions. [2019-01-14 20:00:58,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:00:58,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-14 20:00:58,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:00:58,236 INFO L225 Difference]: With dead ends: 194 [2019-01-14 20:00:58,237 INFO L226 Difference]: Without dead ends: 194 [2019-01-14 20:00:58,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:00:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-14 20:00:58,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 111. [2019-01-14 20:00:58,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 20:00:58,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2019-01-14 20:00:58,244 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 15 [2019-01-14 20:00:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:00:58,245 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2019-01-14 20:00:58,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:00:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2019-01-14 20:00:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 20:00:58,246 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:00:58,246 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] [2019-01-14 20:00:58,246 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:00:58,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:00:58,247 INFO L82 PathProgramCache]: Analyzing trace with hash -584261800, now seen corresponding path program 1 times [2019-01-14 20:00:58,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:00:58,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:00:58,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:58,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:00:58,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:00:58,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:00:58,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:00:58,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:00:58,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:00:58,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:00:58,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:00:58,312 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand 5 states. [2019-01-14 20:00:58,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:00:58,518 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2019-01-14 20:00:58,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:00:58,519 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 20:00:58,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:00:58,521 INFO L225 Difference]: With dead ends: 133 [2019-01-14 20:00:58,521 INFO L226 Difference]: Without dead ends: 133 [2019-01-14 20:00:58,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:00:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-14 20:00:58,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 111. [2019-01-14 20:00:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 20:00:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-01-14 20:00:58,527 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 21 [2019-01-14 20:00:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:00:58,527 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-01-14 20:00:58,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:00:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-01-14 20:00:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 20:00:58,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:00:58,529 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] [2019-01-14 20:00:58,529 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:00:58,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:00:58,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1176305992, now seen corresponding path program 1 times [2019-01-14 20:00:58,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:00:58,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:00:58,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:58,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:00:58,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:00:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:00:58,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:00:58,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:00:58,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:00:58,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:00:58,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:00:58,755 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 5 states. [2019-01-14 20:00:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:00:59,011 INFO L93 Difference]: Finished difference Result 117 states and 127 transitions. [2019-01-14 20:00:59,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:00:59,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-14 20:00:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:00:59,014 INFO L225 Difference]: With dead ends: 117 [2019-01-14 20:00:59,014 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 20:00:59,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:00:59,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 20:00:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2019-01-14 20:00:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 20:00:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-01-14 20:00:59,019 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 23 [2019-01-14 20:00:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:00:59,020 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-01-14 20:00:59,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:00:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-01-14 20:00:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 20:00:59,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:00:59,021 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] [2019-01-14 20:00:59,021 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:00:59,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:00:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash -653023129, now seen corresponding path program 1 times [2019-01-14 20:00:59,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:00:59,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:00:59,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:59,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:00:59,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:00:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:00:59,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:00:59,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:00:59,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:00:59,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:00:59,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:00:59,097 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 6 states. [2019-01-14 20:00:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:00:59,492 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2019-01-14 20:00:59,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:00:59,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-14 20:00:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:00:59,495 INFO L225 Difference]: With dead ends: 178 [2019-01-14 20:00:59,495 INFO L226 Difference]: Without dead ends: 178 [2019-01-14 20:00:59,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:00:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-01-14 20:00:59,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 109. [2019-01-14 20:00:59,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 20:00:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-01-14 20:00:59,499 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 23 [2019-01-14 20:00:59,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:00:59,499 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-01-14 20:00:59,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:00:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-01-14 20:00:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 20:00:59,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:00:59,501 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] [2019-01-14 20:00:59,501 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:00:59,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:00:59,501 INFO L82 PathProgramCache]: Analyzing trace with hash -653023128, now seen corresponding path program 1 times [2019-01-14 20:00:59,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:00:59,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:00:59,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:59,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:00:59,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:00:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:00:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:00:59,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:00:59,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:00:59,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:00:59,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:00:59,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:00:59,728 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 6 states. [2019-01-14 20:01:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:00,599 INFO L93 Difference]: Finished difference Result 194 states and 211 transitions. [2019-01-14 20:01:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:01:00,600 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-01-14 20:01:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:00,602 INFO L225 Difference]: With dead ends: 194 [2019-01-14 20:01:00,602 INFO L226 Difference]: Without dead ends: 194 [2019-01-14 20:01:00,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:01:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-14 20:01:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 101. [2019-01-14 20:01:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-14 20:01:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-01-14 20:01:00,607 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 23 [2019-01-14 20:01:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:00,607 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-01-14 20:01:00,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:01:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-01-14 20:01:00,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 20:01:00,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:00,608 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 20:01:00,609 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:00,609 INFO L82 PathProgramCache]: Analyzing trace with hash -562636110, now seen corresponding path program 1 times [2019-01-14 20:01:00,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:00,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:00,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:00,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:00,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:00,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:00,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:01:00,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:01:00,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:01:00,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:01:00,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:01:00,751 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 5 states. [2019-01-14 20:01:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:00,983 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-01-14 20:01:00,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:01:00,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-01-14 20:01:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:00,985 INFO L225 Difference]: With dead ends: 115 [2019-01-14 20:01:00,985 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 20:01:00,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:01:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 20:01:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-14 20:01:00,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-14 20:01:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-01-14 20:01:00,989 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 27 [2019-01-14 20:01:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:00,989 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-01-14 20:01:00,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:01:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-01-14 20:01:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 20:01:00,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:00,990 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 20:01:00,991 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:00,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:00,991 INFO L82 PathProgramCache]: Analyzing trace with hash -140383124, now seen corresponding path program 1 times [2019-01-14 20:01:00,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:00,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:00,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:00,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:00,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:01,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:01:01,271 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:01:01,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:01,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:01:01,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:01,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:01,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-14 20:01:01,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:01,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:01,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-01-14 20:01:01,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:01,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:01,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:01,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:01,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:01,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-01-14 20:01:01,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:01,993 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 36 treesize of output 37 [2019-01-14 20:01:01,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:01,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:02,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:02,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:02,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-01-14 20:01:02,148 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 60 treesize of output 50 [2019-01-14 20:01:02,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:02,164 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 18 [2019-01-14 20:01:02,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:02,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:02,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:02,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-01-14 20:01:02,347 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 36 treesize of output 24 [2019-01-14 20:01:02,352 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 [2019-01-14 20:01:02,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:02,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:02,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:02,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:02,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:02,385 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-01-14 20:01:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:02,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:01:02,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2019-01-14 20:01:02,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 20:01:02,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 20:01:02,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-14 20:01:02,591 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 22 states. [2019-01-14 20:01:02,853 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-01-14 20:01:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:04,276 INFO L93 Difference]: Finished difference Result 198 states and 211 transitions. [2019-01-14 20:01:04,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 20:01:04,277 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-01-14 20:01:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:04,279 INFO L225 Difference]: With dead ends: 198 [2019-01-14 20:01:04,279 INFO L226 Difference]: Without dead ends: 198 [2019-01-14 20:01:04,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=728, Unknown=0, NotChecked=0, Total=930 [2019-01-14 20:01:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-14 20:01:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 128. [2019-01-14 20:01:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-14 20:01:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2019-01-14 20:01:04,285 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 36 [2019-01-14 20:01:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:04,286 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2019-01-14 20:01:04,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 20:01:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2019-01-14 20:01:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-14 20:01:04,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:04,287 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 20:01:04,287 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:04,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:04,288 INFO L82 PathProgramCache]: Analyzing trace with hash -140383123, now seen corresponding path program 1 times [2019-01-14 20:01:04,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:04,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:04,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:04,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:04,522 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-14 20:01:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:04,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:01:04,673 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 20:01:04,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:04,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:01:04,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 20:01:04,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:04,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:04,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:04,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 20:01:04,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:04,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:04,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-14 20:01:05,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:05,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:05,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:05,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:05,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-01-14 20:01:05,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:05,132 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 36 treesize of output 37 [2019-01-14 20:01:05,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:05,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:05,207 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 19 treesize of output 24 [2019-01-14 20:01:05,210 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 12 treesize of output 11 [2019-01-14 20:01:05,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,219 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,240 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2019-01-14 20:01:05,284 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 102 treesize of output 92 [2019-01-14 20:01:05,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:05,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, 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 18 [2019-01-14 20:01:05,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,352 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 50 treesize of output 45 [2019-01-14 20:01:05,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:05,358 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 18 [2019-01-14 20:01:05,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:05,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:47 [2019-01-14 20:01:05,532 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 47 treesize of output 33 [2019-01-14 20:01:05,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2019-01-14 20:01:05,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:05,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,711 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 22 treesize of output 20 [2019-01-14 20:01:05,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:05,714 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 20:01:05,721 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,724 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:05,728 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-01-14 20:01:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:05,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:01:05,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2019-01-14 20:01:05,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 20:01:05,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 20:01:05,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-01-14 20:01:05,771 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand 17 states. [2019-01-14 20:01:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:07,407 INFO L93 Difference]: Finished difference Result 203 states and 219 transitions. [2019-01-14 20:01:07,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 20:01:07,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2019-01-14 20:01:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:07,411 INFO L225 Difference]: With dead ends: 203 [2019-01-14 20:01:07,411 INFO L226 Difference]: Without dead ends: 203 [2019-01-14 20:01:07,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2019-01-14 20:01:07,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-14 20:01:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2019-01-14 20:01:07,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-14 20:01:07,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2019-01-14 20:01:07,417 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 36 [2019-01-14 20:01:07,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:07,418 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2019-01-14 20:01:07,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 20:01:07,418 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2019-01-14 20:01:07,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-14 20:01:07,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:07,419 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 20:01:07,420 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:07,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:07,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1764205122, now seen corresponding path program 1 times [2019-01-14 20:01:07,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:07,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:07,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:07,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:07,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 20:01:07,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:01:07,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 20:01:07,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:01:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:01:07,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:01:07,613 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand 6 states. [2019-01-14 20:01:07,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:07,800 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-01-14 20:01:07,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 20:01:07,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-01-14 20:01:07,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:07,802 INFO L225 Difference]: With dead ends: 94 [2019-01-14 20:01:07,802 INFO L226 Difference]: Without dead ends: 94 [2019-01-14 20:01:07,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:01:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-14 20:01:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2019-01-14 20:01:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-14 20:01:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2019-01-14 20:01:07,814 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 38 [2019-01-14 20:01:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:07,814 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2019-01-14 20:01:07,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:01:07,814 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2019-01-14 20:01:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 20:01:07,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:07,816 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-14 20:01:07,817 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:07,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1122139694, now seen corresponding path program 1 times [2019-01-14 20:01:07,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:07,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:07,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:07,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:07,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:08,106 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-01-14 20:01:08,322 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-01-14 20:01:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:09,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:01:09,195 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:01:09,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:09,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:01:09,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 20:01:09,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:09,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:09,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 20:01:09,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-01-14 20:01:09,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:09,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:09,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:09,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:09,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,572 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-01-14 20:01:09,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:09,758 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 36 treesize of output 37 [2019-01-14 20:01:09,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:09,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:09,845 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 19 treesize of output 24 [2019-01-14 20:01:09,848 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 12 treesize of output 11 [2019-01-14 20:01:09,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:53 [2019-01-14 20:01:09,926 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 21 treesize of output 3 [2019-01-14 20:01:09,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,961 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 114 treesize of output 104 [2019-01-14 20:01:09,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:09,970 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 18 [2019-01-14 20:01:09,971 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:09,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,017 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 21 treesize of output 14 [2019-01-14 20:01:10,021 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 14 treesize of output 13 [2019-01-14 20:01:10,021 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,024 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,051 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 50 treesize of output 45 [2019-01-14 20:01:10,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:10,057 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 18 [2019-01-14 20:01:10,058 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,065 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:10,081 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:144, output treesize:57 [2019-01-14 20:01:10,264 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 51 treesize of output 37 [2019-01-14 20:01:10,268 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 32 treesize of output 21 [2019-01-14 20:01:10,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:10,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,308 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 22 treesize of output 20 [2019-01-14 20:01:10,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:10,311 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 20:01:10,320 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,323 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:10,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:10,333 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:19 [2019-01-14 20:01:10,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2019-01-14 20:01:10,410 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 1 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 20:01:10,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:01:10,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:01:10,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:01:10,433 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2019-01-14 20:01:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:10,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:01:10,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 32 [2019-01-14 20:01:10,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 20:01:10,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 20:01:10,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2019-01-14 20:01:10,569 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand 32 states. [2019-01-14 20:01:13,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:13,749 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2019-01-14 20:01:13,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 20:01:13,750 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-01-14 20:01:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:13,752 INFO L225 Difference]: With dead ends: 125 [2019-01-14 20:01:13,752 INFO L226 Difference]: Without dead ends: 124 [2019-01-14 20:01:13,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=337, Invalid=2014, Unknown=1, NotChecked=0, Total=2352 [2019-01-14 20:01:13,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-14 20:01:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2019-01-14 20:01:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-14 20:01:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2019-01-14 20:01:13,765 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 40 [2019-01-14 20:01:13,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:13,765 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2019-01-14 20:01:13,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 20:01:13,765 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2019-01-14 20:01:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 20:01:13,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:13,768 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-01-14 20:01:13,768 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:13,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1646153555, now seen corresponding path program 1 times [2019-01-14 20:01:13,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:13,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:13,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:13,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:13,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:14,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:01:14,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:01:14,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:14,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:01:14,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:14,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:14,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 20:01:14,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-14 20:01:14,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:14,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:14,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:14,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:14,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-01-14 20:01:14,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:14,647 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 26 treesize of output 31 [2019-01-14 20:01:14,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 12 treesize of output 15 [2019-01-14 20:01:14,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:14,686 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 42 treesize of output 43 [2019-01-14 20:01:14,689 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 11 [2019-01-14 20:01:14,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:59 [2019-01-14 20:01:14,775 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-01-14 20:01:14,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:14,781 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 45 [2019-01-14 20:01:14,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:14,824 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 61 treesize of output 60 [2019-01-14 20:01:14,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:14,831 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 22 [2019-01-14 20:01:14,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:97, output treesize:59 [2019-01-14 20:01:14,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 [2019-01-14 20:01:14,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:68, output treesize:67 [2019-01-14 20:01:14,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:14,953 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 63 [2019-01-14 20:01:14,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-14 20:01:14,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:14,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:15,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:15,025 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 53 treesize of output 52 [2019-01-14 20:01:15,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 18 treesize of output 26 [2019-01-14 20:01:15,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:15,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:15,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:15,066 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:91, output treesize:66 [2019-01-14 20:01:15,276 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 89 [2019-01-14 20:01:15,283 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:15,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 74 treesize of output 68 [2019-01-14 20:01:15,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:15,373 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 74 [2019-01-14 20:01:15,373 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:15,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:15,477 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 115 [2019-01-14 20:01:15,487 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:15,490 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 89 treesize of output 77 [2019-01-14 20:01:15,493 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:15,708 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 92 treesize of output 103 [2019-01-14 20:01:15,708 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:15,847 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:15,952 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:15,955 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 74 treesize of output 86 [2019-01-14 20:01:15,956 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:16,265 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2019-01-14 20:01:16,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2019-01-14 20:01:16,824 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:100, output treesize:417 [2019-01-14 20:01:17,049 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-01-14 20:01:17,111 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 194 [2019-01-14 20:01:17,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:17,126 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 191 treesize of output 183 [2019-01-14 20:01:17,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:17,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:17,737 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 138 [2019-01-14 20:01:17,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:17,754 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 148 treesize of output 140 [2019-01-14 20:01:17,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:17,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:18,089 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 121 treesize of output 116 [2019-01-14 20:01:18,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:18,098 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 38 treesize of output 22 [2019-01-14 20:01:18,099 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:18,121 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:18,241 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 144 treesize of output 134 [2019-01-14 20:01:18,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:18,249 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 50 treesize of output 46 [2019-01-14 20:01:18,250 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:18,302 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:18,390 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 86 treesize of output 73 [2019-01-14 20:01:18,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:18,398 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 54 treesize of output 80 [2019-01-14 20:01:18,399 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:18,414 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:18,489 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 105 treesize of output 86 [2019-01-14 20:01:18,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:18,500 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 59 treesize of output 53 [2019-01-14 20:01:18,501 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:18,530 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:18,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 20:01:18,591 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:450, output treesize:216 [2019-01-14 20:01:18,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 100 [2019-01-14 20:01:18,921 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 84 treesize of output 66 [2019-01-14 20:01:18,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,084 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 66 treesize of output 55 [2019-01-14 20:01:19,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,161 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 64 treesize of output 51 [2019-01-14 20:01:19,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,383 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 65 treesize of output 55 [2019-01-14 20:01:19,391 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 29 treesize of output 21 [2019-01-14 20:01:19,391 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,438 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 [2019-01-14 20:01:19,438 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,524 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 80 treesize of output 60 [2019-01-14 20:01:19,541 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 19 [2019-01-14 20:01:19,542 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,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 24 treesize of output 18 [2019-01-14 20:01:19,557 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,568 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 20:01:19,620 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:258, output treesize:133 [2019-01-14 20:01:19,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:19,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:19,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 36 treesize of output 34 [2019-01-14 20:01:19,846 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2019-01-14 20:01:19,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,855 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 25 treesize of output 14 [2019-01-14 20:01:19,855 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:19,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:19,894 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53 [2019-01-14 20:01:19,903 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 48 [2019-01-14 20:01:19,905 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:01:19,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2019-01-14 20:01:19,950 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:19,979 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 45 treesize of output 34 [2019-01-14 20:01:19,979 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:20,009 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 34 treesize of output 32 [2019-01-14 20:01:20,010 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:20,039 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 32 treesize of output 27 [2019-01-14 20:01:20,040 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:20,068 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:01:20,101 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 3 xjuncts. [2019-01-14 20:01:20,102 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:90, output treesize:41 [2019-01-14 20:01:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:20,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:01:20,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 34 [2019-01-14 20:01:20,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-14 20:01:20,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-14 20:01:20,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1078, Unknown=0, NotChecked=0, Total=1190 [2019-01-14 20:01:20,237 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand 35 states. [2019-01-14 20:01:21,038 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 39 [2019-01-14 20:01:21,401 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 61 [2019-01-14 20:01:21,874 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 63 [2019-01-14 20:01:22,249 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 50 [2019-01-14 20:01:22,797 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 68 [2019-01-14 20:01:23,130 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 49 [2019-01-14 20:01:23,416 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 54 [2019-01-14 20:01:23,633 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-01-14 20:01:23,851 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-01-14 20:01:24,074 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-01-14 20:01:24,272 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2019-01-14 20:01:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:24,544 INFO L93 Difference]: Finished difference Result 159 states and 167 transitions. [2019-01-14 20:01:24,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-14 20:01:24,545 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 42 [2019-01-14 20:01:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:24,547 INFO L225 Difference]: With dead ends: 159 [2019-01-14 20:01:24,547 INFO L226 Difference]: Without dead ends: 159 [2019-01-14 20:01:24,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=485, Invalid=2937, Unknown=0, NotChecked=0, Total=3422 [2019-01-14 20:01:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-14 20:01:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2019-01-14 20:01:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 20:01:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-01-14 20:01:24,553 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 42 [2019-01-14 20:01:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:24,553 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-01-14 20:01:24,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-14 20:01:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-01-14 20:01:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 20:01:24,557 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:24,557 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-01-14 20:01:24,558 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1646153556, now seen corresponding path program 1 times [2019-01-14 20:01:24,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:24,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:24,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:25,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:01:25,128 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:01:25,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:25,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:01:25,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 20:01:25,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:25,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:25,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 20:01:25,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-01-14 20:01:25,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:25,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:25,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:25,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:25,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-01-14 20:01:25,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:25,833 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 36 treesize of output 37 [2019-01-14 20:01:25,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2019-01-14 20:01:25,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:25,875 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 37 treesize of output 42 [2019-01-14 20:01:25,878 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 12 treesize of output 15 [2019-01-14 20:01:25,879 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:25,905 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:69, output treesize:73 [2019-01-14 20:01:25,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:25,983 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 70 treesize of output 69 [2019-01-14 20:01:25,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:25,989 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 22 [2019-01-14 20:01:25,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,040 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-01-14 20:01:26,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:26,046 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 45 [2019-01-14 20:01:26,046 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:73 [2019-01-14 20:01:26,086 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 15 [2019-01-14 20:01:26,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:26,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:26,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 20:01:26,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:77 [2019-01-14 20:01:26,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:26,216 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2019-01-14 20:01:26,224 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 26 [2019-01-14 20:01:26,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:26,276 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2019-01-14 20:01:26,281 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 22 treesize of output 30 [2019-01-14 20:01:26,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,314 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:59 [2019-01-14 20:01:26,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:26,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:26,484 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 3 case distinctions, treesize of input 69 treesize of output 84 [2019-01-14 20:01:26,491 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 86 treesize of output 85 [2019-01-14 20:01:26,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,611 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 2 case distinctions, treesize of input 44 treesize of output 47 [2019-01-14 20:01:26,612 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 20:01:26,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:01:26,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:26,783 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 53 treesize of output 58 [2019-01-14 20:01:26,786 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 12 treesize of output 15 [2019-01-14 20:01:26,786 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,804 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:26,814 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 83 treesize of output 84 [2019-01-14 20:01:26,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:26,817 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,835 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:01:26,877 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:90, output treesize:143 [2019-01-14 20:01:26,966 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 136 treesize of output 123 [2019-01-14 20:01:26,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:26,975 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 42 treesize of output 30 [2019-01-14 20:01:26,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:26,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:27,058 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 201 treesize of output 175 [2019-01-14 20:01:27,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:27,065 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 46 treesize of output 26 [2019-01-14 20:01:27,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:27,089 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:27,149 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 97 treesize of output 87 [2019-01-14 20:01:27,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:27,163 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 42 treesize of output 30 [2019-01-14 20:01:27,164 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:27,179 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:27,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:27,261 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 122 [2019-01-14 20:01:27,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:27,311 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 3 case distinctions, treesize of input 108 treesize of output 99 [2019-01-14 20:01:27,313 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-14 20:01:27,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:27,411 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 117 treesize of output 97 [2019-01-14 20:01:27,412 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:27,465 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:01:27,521 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 3 xjuncts. [2019-01-14 20:01:27,521 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:338, output treesize:212 [2019-01-14 20:01:27,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:27,869 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-14 20:01:27,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 89 [2019-01-14 20:01:27,890 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 65 [2019-01-14 20:01:27,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-14 20:01:27,963 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 61 treesize of output 52 [2019-01-14 20:01:27,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:27,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 57 treesize of output 48 [2019-01-14 20:01:27,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,029 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 82 treesize of output 77 [2019-01-14 20:01:28,030 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,094 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 77 treesize of output 68 [2019-01-14 20:01:28,095 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,154 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 68 treesize of output 44 [2019-01-14 20:01:28,155 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:28,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 20:01:28,309 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 69 treesize of output 55 [2019-01-14 20:01:28,313 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 9 treesize of output 7 [2019-01-14 20:01:28,313 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,329 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 32 treesize of output 21 [2019-01-14 20:01:28,329 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,341 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,433 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 73 treesize of output 59 [2019-01-14 20:01:28,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2019-01-14 20:01:28,437 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,452 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 [2019-01-14 20:01:28,452 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,464 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,550 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 48 treesize of output 40 [2019-01-14 20:01:28,554 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 17 treesize of output 8 [2019-01-14 20:01:28,554 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,571 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 5 treesize of output 1 [2019-01-14 20:01:28,571 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,582 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,587 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 52 treesize of output 38 [2019-01-14 20:01:28,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:28,590 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,604 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 24 treesize of output 13 [2019-01-14 20:01:28,604 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,615 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 44 treesize of output 38 [2019-01-14 20:01:28,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:28,623 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 20:01:28,639 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,652 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,735 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 35 treesize of output 27 [2019-01-14 20:01:28,737 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 5 [2019-01-14 20:01:28,738 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 20:01:28,744 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,750 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,811 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 41 treesize of output 29 [2019-01-14 20:01:28,817 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 [2019-01-14 20:01:28,817 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,825 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 [2019-01-14 20:01:28,825 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,830 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:28,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-14 20:01:28,901 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 10 variables, input treesize:245, output treesize:56 [2019-01-14 20:01:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:28,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:01:28,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 31 [2019-01-14 20:01:28,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 20:01:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 20:01:28,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=850, Unknown=0, NotChecked=0, Total=992 [2019-01-14 20:01:28,954 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 32 states. [2019-01-14 20:01:29,751 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-01-14 20:01:30,379 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2019-01-14 20:01:30,769 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 61 [2019-01-14 20:01:30,967 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-14 20:01:31,213 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 51 [2019-01-14 20:01:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:31,463 INFO L93 Difference]: Finished difference Result 153 states and 163 transitions. [2019-01-14 20:01:31,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 20:01:31,465 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 42 [2019-01-14 20:01:31,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:31,466 INFO L225 Difference]: With dead ends: 153 [2019-01-14 20:01:31,466 INFO L226 Difference]: Without dead ends: 153 [2019-01-14 20:01:31,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2019-01-14 20:01:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-14 20:01:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-01-14 20:01:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-14 20:01:31,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2019-01-14 20:01:31,471 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 42 [2019-01-14 20:01:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:31,471 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2019-01-14 20:01:31,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 20:01:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2019-01-14 20:01:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 20:01:31,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:31,472 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2019-01-14 20:01:31,472 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:31,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash -792234856, now seen corresponding path program 2 times [2019-01-14 20:01:31,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:31,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:31,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:31,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:01:31,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:01:31,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:01:31,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:01:31,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:01:31,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:01:31,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:31,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:31,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 20:01:31,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:31,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:31,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-14 20:01:32,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:32,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:32,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:32,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:32,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2019-01-14 20:01:32,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:32,173 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 26 treesize of output 31 [2019-01-14 20:01:32,177 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 12 treesize of output 15 [2019-01-14 20:01:32,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:32,214 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 42 treesize of output 43 [2019-01-14 20:01:32,218 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 11 [2019-01-14 20:01:32,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:59 [2019-01-14 20:01:32,368 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 117 treesize of output 107 [2019-01-14 20:01:32,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:32,380 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 42 treesize of output 30 [2019-01-14 20:01:32,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,416 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 77 treesize of output 72 [2019-01-14 20:01:32,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:32,422 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 42 treesize of output 30 [2019-01-14 20:01:32,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:127, output treesize:49 [2019-01-14 20:01:32,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:32,679 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:32,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 69 [2019-01-14 20:01:32,687 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:32,688 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2019-01-14 20:01:32,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:32,702 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:32,703 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 19 treesize of output 26 [2019-01-14 20:01:32,704 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:32,735 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 37 treesize of output 29 [2019-01-14 20:01:32,762 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:32,763 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 25 treesize of output 17 [2019-01-14 20:01:32,764 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,781 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 7 [2019-01-14 20:01:32,782 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,785 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:32,793 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:82, output treesize:7 [2019-01-14 20:01:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:32,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:01:32,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2019-01-14 20:01:32,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-14 20:01:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-14 20:01:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=724, Unknown=1, NotChecked=0, Total=812 [2019-01-14 20:01:32,870 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand 29 states. [2019-01-14 20:01:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:34,317 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2019-01-14 20:01:34,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 20:01:34,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 44 [2019-01-14 20:01:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:34,320 INFO L225 Difference]: With dead ends: 124 [2019-01-14 20:01:34,320 INFO L226 Difference]: Without dead ends: 105 [2019-01-14 20:01:34,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=1276, Unknown=1, NotChecked=0, Total=1482 [2019-01-14 20:01:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-14 20:01:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 97. [2019-01-14 20:01:34,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-14 20:01:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2019-01-14 20:01:34,323 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 44 [2019-01-14 20:01:34,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:34,324 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2019-01-14 20:01:34,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-14 20:01:34,324 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2019-01-14 20:01:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 20:01:34,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:34,325 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2019-01-14 20:01:34,325 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1555442674, now seen corresponding path program 3 times [2019-01-14 20:01:34,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:34,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:34,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:01:34,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:34,642 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-14 20:01:34,904 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-14 20:01:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:35,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:01:35,185 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:01:35,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 20:01:35,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 20:01:35,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:01:35,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:01:35,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:35,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:35,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 20:01:35,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-01-14 20:01:35,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:35,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:35,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:23 [2019-01-14 20:01:35,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:35,750 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 27 treesize of output 28 [2019-01-14 20:01:35,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:35,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-01-14 20:01:35,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:35,801 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 42 treesize of output 41 [2019-01-14 20:01:35,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:35,807 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 22 treesize of output 14 [2019-01-14 20:01:35,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:31 [2019-01-14 20:01:35,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:35,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:35,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-14 20:01:35,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-01-14 20:01:35,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:35,869 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-14 20:01:35,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2019-01-14 20:01:35,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:35,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:32 [2019-01-14 20:01:36,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:36,143 INFO L303 Elim1Store]: Index analysis took 157 ms [2019-01-14 20:01:36,157 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 3 case distinctions, treesize of input 52 treesize of output 65 [2019-01-14 20:01:36,161 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 61 treesize of output 60 [2019-01-14 20:01:36,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:36,224 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 36 treesize of output 39 [2019-01-14 20:01:36,225 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 20:01:36,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:01:36,290 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 2 xjuncts. [2019-01-14 20:01:36,290 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:83 [2019-01-14 20:01:36,388 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 79 [2019-01-14 20:01:36,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:36,408 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 3 case distinctions, treesize of input 61 treesize of output 73 [2019-01-14 20:01:36,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 20:01:36,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:36,475 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 70 treesize of output 54 [2019-01-14 20:01:36,475 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:36,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 20:01:36,563 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 63 treesize of output 53 [2019-01-14 20:01:36,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:36,568 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 18 [2019-01-14 20:01:36,568 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:36,576 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:36,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-01-14 20:01:36,614 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:155, output treesize:113 [2019-01-14 20:01:36,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2019-01-14 20:01:36,992 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:36,993 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 44 treesize of output 36 [2019-01-14 20:01:36,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:37,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2019-01-14 20:01:37,027 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:37,053 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 25 treesize of output 21 [2019-01-14 20:01:37,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:37,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:37,097 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 42 treesize of output 35 [2019-01-14 20:01:37,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:37,100 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:37,109 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:37,110 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 19 treesize of output 13 [2019-01-14 20:01:37,111 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:37,123 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:37,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:37,137 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 9 variables, input treesize:101, output treesize:5 [2019-01-14 20:01:37,164 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:37,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:01:37,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 31 [2019-01-14 20:01:37,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 20:01:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 20:01:37,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=869, Unknown=1, NotChecked=0, Total=992 [2019-01-14 20:01:37,195 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand 32 states. [2019-01-14 20:01:38,807 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-01-14 20:01:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:39,479 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2019-01-14 20:01:39,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 20:01:39,481 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-01-14 20:01:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:39,482 INFO L225 Difference]: With dead ends: 161 [2019-01-14 20:01:39,482 INFO L226 Difference]: Without dead ends: 161 [2019-01-14 20:01:39,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=368, Invalid=2077, Unknown=5, NotChecked=0, Total=2450 [2019-01-14 20:01:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-14 20:01:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2019-01-14 20:01:39,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-14 20:01:39,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2019-01-14 20:01:39,489 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 45 [2019-01-14 20:01:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:39,489 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2019-01-14 20:01:39,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 20:01:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2019-01-14 20:01:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 20:01:39,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:39,493 INFO L402 BasicCegarLoop]: trace histogram [3, 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] [2019-01-14 20:01:39,494 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:39,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:39,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1555442675, now seen corresponding path program 2 times [2019-01-14 20:01:39,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:39,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:39,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:39,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:01:39,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:39,853 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-14 20:01:40,051 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 20:01:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:40,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:01:40,747 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:01:40,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:01:40,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:01:40,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:01:40,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:01:40,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 20:01:40,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:40,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:40,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:40,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-14 20:01:40,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:40,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:40,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-01-14 20:01:40,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:40,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:40,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:40,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:40,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:40,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:40,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:40,955 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:40,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:40,972 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2019-01-14 20:01:41,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,084 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 46 [2019-01-14 20:01:41,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:41,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,125 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 19 treesize of output 24 [2019-01-14 20:01:41,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 20:01:41,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,135 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:67 [2019-01-14 20:01:41,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,315 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-14 20:01:41,315 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 71 treesize of output 70 [2019-01-14 20:01:41,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,344 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 22 treesize of output 14 [2019-01-14 20:01:41,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,399 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 44 [2019-01-14 20:01:41,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,406 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 37 [2019-01-14 20:01:41,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,438 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:67 [2019-01-14 20:01:41,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,448 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 [2019-01-14 20:01:41,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,474 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 16 treesize of output 23 [2019-01-14 20:01:41,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:70 [2019-01-14 20:01:41,565 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 30 treesize of output 40 [2019-01-14 20:01:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2019-01-14 20:01:41,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,617 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2019-01-14 20:01:41,621 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 14 treesize of output 7 [2019-01-14 20:01:41,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,660 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:64 [2019-01-14 20:01:41,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,780 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 19 treesize of output 28 [2019-01-14 20:01:41,783 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 16 treesize of output 15 [2019-01-14 20:01:41,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:41,840 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 96 treesize of output 92 [2019-01-14 20:01:41,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:41,848 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:41,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:41,897 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:102, output treesize:94 [2019-01-14 20:01:42,005 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2019-01-14 20:01:42,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:42,017 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 38 treesize of output 22 [2019-01-14 20:01:42,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:42,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:42,074 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 132 treesize of output 97 [2019-01-14 20:01:42,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:42,083 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 38 treesize of output 22 [2019-01-14 20:01:42,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:42,109 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:42,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:42,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:185, output treesize:99 [2019-01-14 20:01:42,291 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 64 [2019-01-14 20:01:42,297 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:42,298 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 27 treesize of output 19 [2019-01-14 20:01:42,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:42,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:42,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:42,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-01-14 20:01:42,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:42,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:42,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 20 [2019-01-14 20:01:42,399 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:42,400 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 11 treesize of output 7 [2019-01-14 20:01:42,400 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:42,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:42,409 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:42,413 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:42,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:42,428 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:116, output treesize:18 [2019-01-14 20:01:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:42,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:01:42,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2019-01-14 20:01:42,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 20:01:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 20:01:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=974, Unknown=1, NotChecked=0, Total=1122 [2019-01-14 20:01:42,529 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 34 states. [2019-01-14 20:01:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:44,816 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2019-01-14 20:01:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 20:01:44,818 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 45 [2019-01-14 20:01:44,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:44,820 INFO L225 Difference]: With dead ends: 166 [2019-01-14 20:01:44,820 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 20:01:44,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=350, Invalid=2001, Unknown=1, NotChecked=0, Total=2352 [2019-01-14 20:01:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 20:01:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 104. [2019-01-14 20:01:44,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 20:01:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-01-14 20:01:44,824 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 45 [2019-01-14 20:01:44,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:44,824 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-01-14 20:01:44,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 20:01:44,824 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-01-14 20:01:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 20:01:44,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:44,825 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-01-14 20:01:44,826 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:44,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:44,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2129324651, now seen corresponding path program 1 times [2019-01-14 20:01:44,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:44,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:44,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:44,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:01:44,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:45,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:01:45,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:01:45,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:45,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:01:45,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:45,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:45,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-14 20:01:45,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:45,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:45,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-01-14 20:01:45,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:45,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:45,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:45,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:45,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01: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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:45,953 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:45,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:45,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:45,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:36 [2019-01-14 20:01:46,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,079 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 36 treesize of output 37 [2019-01-14 20:01:46,081 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 11 [2019-01-14 20:01:46,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,113 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 37 treesize of output 42 [2019-01-14 20:01:46,116 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 12 treesize of output 15 [2019-01-14 20:01:46,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,124 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,140 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:66, output treesize:70 [2019-01-14 20:01:46,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,198 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 70 treesize of output 69 [2019-01-14 20:01:46,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,204 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 22 [2019-01-14 20:01:46,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,251 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-01-14 20:01:46,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,257 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 45 [2019-01-14 20:01:46,257 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:70 [2019-01-14 20:01:46,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 46 [2019-01-14 20:01:46,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:81, output treesize:87 [2019-01-14 20:01:46,394 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 52 treesize of output 58 [2019-01-14 20:01:46,398 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 22 treesize of output 30 [2019-01-14 20:01:46,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,451 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 69 [2019-01-14 20:01:46,455 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 18 treesize of output 26 [2019-01-14 20:01:46,455 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:109, output treesize:85 [2019-01-14 20:01:46,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,667 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 97 treesize of output 97 [2019-01-14 20:01:46,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:46,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,727 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 68 [2019-01-14 20:01:46,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:46,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,768 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:120, output treesize:100 [2019-01-14 20:01:46,845 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 219 treesize of output 164 [2019-01-14 20:01:46,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,852 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 46 treesize of output 26 [2019-01-14 20:01:46,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,926 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 154 treesize of output 128 [2019-01-14 20:01:46,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:46,931 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 46 treesize of output 26 [2019-01-14 20:01:46,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:46,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:46,979 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:231, output treesize:121 [2019-01-14 20:01:47,394 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 93 [2019-01-14 20:01:47,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:47,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:47,474 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 75 treesize of output 60 [2019-01-14 20:01:47,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:47,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:47,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:47,508 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:135, output treesize:89 [2019-01-14 20:01:47,608 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 85 treesize of output 50 [2019-01-14 20:01:47,611 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 22 treesize of output 16 [2019-01-14 20:01:47,612 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:47,628 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 25 treesize of output 14 [2019-01-14 20:01:47,628 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:47,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 5 treesize of output 1 [2019-01-14 20:01:47,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:47,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:47,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:47,665 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:28 [2019-01-14 20:01:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:47,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:01:47,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 35 [2019-01-14 20:01:47,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 20:01:47,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 20:01:47,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 20:01:47,785 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 36 states. [2019-01-14 20:01:48,314 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-01-14 20:01:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:50,233 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2019-01-14 20:01:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 20:01:50,236 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2019-01-14 20:01:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:50,237 INFO L225 Difference]: With dead ends: 164 [2019-01-14 20:01:50,238 INFO L226 Difference]: Without dead ends: 164 [2019-01-14 20:01:50,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=327, Invalid=2025, Unknown=0, NotChecked=0, Total=2352 [2019-01-14 20:01:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-14 20:01:50,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 126. [2019-01-14 20:01:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 20:01:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2019-01-14 20:01:50,242 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 46 [2019-01-14 20:01:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:50,243 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2019-01-14 20:01:50,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 20:01:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2019-01-14 20:01:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-14 20:01:50,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:50,243 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-01-14 20:01:50,244 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:50,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:50,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2129324650, now seen corresponding path program 1 times [2019-01-14 20:01:50,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:50,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:50,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:50,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:50,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:50,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:01:50,732 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 20:01:50,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:01:50,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:01:50,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:50,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:50,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2019-01-14 20:01:50,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:50,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:50,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-01-14 20:01:50,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:50,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:50,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:50,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:50,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 20:01:50,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:50,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:50,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:50,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:50,999 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-14 20:01:51,078 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 19 treesize of output 20 [2019-01-14 20:01:51,081 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 11 [2019-01-14 20:01:51,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,114 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 30 treesize of output 35 [2019-01-14 20:01:51,117 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 12 treesize of output 15 [2019-01-14 20:01:51,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:55 [2019-01-14 20:01:51,211 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-14 20:01:51,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,218 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 45 [2019-01-14 20:01:51,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2019-01-14 20:01:51,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,266 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 22 [2019-01-14 20:01:51,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:93, output treesize:55 [2019-01-14 20:01:51,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,304 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 16 treesize of output 13 [2019-01-14 20:01:51,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,328 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-14 20:01:51,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2019-01-14 20:01:51,460 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 20:01:51,465 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 45 treesize of output 60 [2019-01-14 20:01:51,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2019-01-14 20:01:51,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,510 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2019-01-14 20:01:51,515 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 18 treesize of output 19 [2019-01-14 20:01:51,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,527 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:71 [2019-01-14 20:01:51,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,679 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 95 treesize of output 112 [2019-01-14 20:01:51,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:51,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,733 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 103 treesize of output 103 [2019-01-14 20:01:51,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 20:01:51,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:114, output treesize:94 [2019-01-14 20:01:51,839 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 217 treesize of output 199 [2019-01-14 20:01:51,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,846 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 46 treesize of output 26 [2019-01-14 20:01:51,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,901 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 170 treesize of output 127 [2019-01-14 20:01:51,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 20:01:51,909 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 46 treesize of output 26 [2019-01-14 20:01:51,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:51,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:51,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:225, output treesize:115 [2019-01-14 20:01:52,176 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 145 treesize of output 98 [2019-01-14 20:01:52,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:52,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:52,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2019-01-14 20:01:52,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:52,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2019-01-14 20:01:52,226 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:52,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 20:01:52,271 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 30 treesize of output 32 [2019-01-14 20:01:52,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 20:01:52,278 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:52,296 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 3 [2019-01-14 20:01:52,296 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 20:01:52,301 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:52,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 20:01:52,316 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:145, output treesize:9 [2019-01-14 20:01:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 20:01:52,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:01:52,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2019-01-14 20:01:52,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 20:01:52,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 20:01:52,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2019-01-14 20:01:52,351 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand 32 states. [2019-01-14 20:01:54,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:01:54,729 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2019-01-14 20:01:54,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 20:01:54,734 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 46 [2019-01-14 20:01:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:01:54,735 INFO L225 Difference]: With dead ends: 162 [2019-01-14 20:01:54,735 INFO L226 Difference]: Without dead ends: 162 [2019-01-14 20:01:54,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=232, Invalid=1838, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 20:01:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-14 20:01:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 126. [2019-01-14 20:01:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-14 20:01:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2019-01-14 20:01:54,744 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 46 [2019-01-14 20:01:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:01:54,744 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2019-01-14 20:01:54,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 20:01:54,745 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2019-01-14 20:01:54,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-14 20:01:54,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:01:54,745 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-01-14 20:01:54,749 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr39ASSERT_VIOLATIONMEMORY_FREE, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr49ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr51ENSURES_VIOLATIONMEMORY_LEAK, mainErr40ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr48ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr38ASSERT_VIOLATIONMEMORY_FREE, mainErr50ASSERT_VIOLATIONMEMORY_FREE, mainErr18REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION]=== [2019-01-14 20:01:54,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:01:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1876553957, now seen corresponding path program 1 times [2019-01-14 20:01:54,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:01:54,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:01:54,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:54,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:01:54,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:01:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 20:01:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 20:01:54,855 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 20:01:54,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 08:01:54 BoogieIcfgContainer [2019-01-14 20:01:54,909 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 20:01:54,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 20:01:54,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 20:01:54,910 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 20:01:54,910 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:00:54" (3/4) ... [2019-01-14 20:01:54,913 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 20:01:54,974 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 20:01:54,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 20:01:54,975 INFO L168 Benchmark]: Toolchain (without parser) took 62564.68 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 475.5 MB). Free memory was 954.0 MB in the beginning and 1.3 GB in the end (delta: -353.5 MB). Peak memory consumption was 122.0 MB. Max. memory is 11.5 GB. [2019-01-14 20:01:54,975 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:01:54,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2019-01-14 20:01:54,976 INFO L168 Benchmark]: Boogie Preprocessor took 96.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-01-14 20:01:54,976 INFO L168 Benchmark]: RCFGBuilder took 1139.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. [2019-01-14 20:01:54,976 INFO L168 Benchmark]: TraceAbstraction took 60658.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 312.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.2 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. [2019-01-14 20:01:54,977 INFO L168 Benchmark]: Witness Printer took 64.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:01:54,978 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 601.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 96.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1139.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 55.8 MB). Peak memory consumption was 55.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60658.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 312.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -225.2 MB). Peak memory consumption was 87.3 MB. Max. memory is 11.5 GB. * Witness Printer took 64.54 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L995] SLL* list = malloc(sizeof(SLL)); VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L996] list->next = ((void*)0) VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L997] list->colour = BLACK VAL [list={2:0}, malloc(sizeof(SLL))={2:0}] [L999] SLL* end = list; VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={2:0}] [L1002] COND TRUE __VERIFIER_nondet_int() [L1005] end->next = malloc(sizeof(SLL)) VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1006] EXPR end->next VAL [end={2:0}, end->next={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1006] end = end->next [L1007] end->next = ((void*)0) VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}] [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1015] end->colour = RED VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}] [L1016] end->next = malloc(sizeof(SLL)) VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1017] EXPR end->next VAL [end={-1:0}, end->next={3:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1017] end = end->next [L1018] end->next = ((void*)0) VAL [end={3:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1019] end->colour = BLACK VAL [end={3:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1002] COND FALSE !(__VERIFIER_nondet_int()) [L1023] end = ((void*)0) [L1024] end = list VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1027] COND FALSE !(!(((void*)0) != end)) VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1028] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1028] COND FALSE !(!(BLACK == end->colour)) [L1030] COND TRUE ((void*)0) != end VAL [end={2:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1032] EXPR end->colour VAL [end={2:0}, end->colour=1, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1032] COND FALSE !(RED == end->colour) [L1038] EXPR end->next VAL [end={2:0}, end->next={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1038] COND FALSE !(!(end->next)) [L1039] EXPR end->next VAL [end={2:0}, end->next={-1:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1039] end = end->next [L1030] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1032] EXPR end->colour VAL [end={-1:0}, end->colour=0, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1032] COND TRUE RED == end->colour [L1034] EXPR end->next VAL [end={-1:0}, end->next={3:0}, list={2:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={3:0}] [L1034] end = end->next [L1035] EXPR end->next VAL [end={3:0}, end->next={0:0}, list={2:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={2:0}, malloc(sizeof(SLL))={3:0}] [L1035] end = end->next [L1038] end->next - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 118 locations, 52 error locations. UNSAFE Result, 60.5s OverallTime, 23 OverallIterations, 3 TraceHistogramMax, 29.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1283 SDtfs, 4676 SDslu, 5811 SDs, 0 SdLazy, 12249 SolverSat, 939 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 820 GetRequests, 295 SyntacticMatches, 33 SemanticMatches, 492 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4699 ImplicationChecksByTransitivity, 25.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=13, 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, 22 MinimizatonAttempts, 869 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1035 ConstructedInterpolants, 175 QuantifiedInterpolants, 1343794 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1942 ConjunctsInSsa, 510 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 14/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...