./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memcleanup.prp --file /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 20:11:12,509 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 20:11:12,510 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 20:11:12,529 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 20:11:12,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 20:11:12,534 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 20:11:12,536 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 20:11:12,538 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 20:11:12,540 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 20:11:12,540 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 20:11:12,542 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 20:11:12,542 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 20:11:12,543 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 20:11:12,544 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 20:11:12,545 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 20:11:12,546 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 20:11:12,547 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 20:11:12,549 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 20:11:12,552 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 20:11:12,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 20:11:12,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 20:11:12,557 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 20:11:12,559 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 20:11:12,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 20:11:12,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 20:11:12,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 20:11:12,563 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 20:11:12,564 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 20:11:12,564 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 20:11:12,566 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 20:11:12,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 20:11:12,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 20:11:12,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 20:11:12,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 20:11:12,569 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 20:11:12,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 20:11:12,570 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-01-01 20:11:12,601 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 20:11:12,601 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 20:11:12,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 20:11:12,603 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 20:11:12,603 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 20:11:12,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 20:11:12,603 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 20:11:12,603 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 20:11:12,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 20:11:12,606 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 20:11:12,606 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 20:11:12,606 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 20:11:12,606 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 20:11:12,607 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 20:11:12,607 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 20:11:12,608 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 20:11:12,608 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 20:11:12,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 20:11:12,609 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 20:11:12,610 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 20:11:12,610 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 20:11:12,610 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 20:11:12,610 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 20:11:12,610 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 20:11:12,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 20:11:12,611 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-memcleanup) ) 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 -> 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 [2019-01-01 20:11:12,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 20:11:12,688 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 20:11:12,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 20:11:12,696 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 20:11:12,697 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 20:11:12,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2019-01-01 20:11:12,756 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8496486/6c2f17ec67c9483e9cb3e1d619bd0c4d/FLAG92e3d3e66 [2019-01-01 20:11:13,245 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 20:11:13,246 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2019-01-01 20:11:13,263 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8496486/6c2f17ec67c9483e9cb3e1d619bd0c4d/FLAG92e3d3e66 [2019-01-01 20:11:13,546 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b8496486/6c2f17ec67c9483e9cb3e1d619bd0c4d [2019-01-01 20:11:13,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 20:11:13,551 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 20:11:13,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 20:11:13,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 20:11:13,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 20:11:13,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:11:13" (1/1) ... [2019-01-01 20:11:13,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f07dccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:13, skipping insertion in model container [2019-01-01 20:11:13,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 08:11:13" (1/1) ... [2019-01-01 20:11:13,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 20:11:13,623 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 20:11:14,009 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:11:14,025 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 20:11:14,086 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 20:11:14,246 INFO L195 MainTranslator]: Completed translation [2019-01-01 20:11:14,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:14 WrapperNode [2019-01-01 20:11:14,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 20:11:14,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 20:11:14,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 20:11:14,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 20:11:14,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:14" (1/1) ... [2019-01-01 20:11:14,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:14" (1/1) ... [2019-01-01 20:11:14,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:14" (1/1) ... [2019-01-01 20:11:14,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:14" (1/1) ... [2019-01-01 20:11:14,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:14" (1/1) ... [2019-01-01 20:11:14,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:14" (1/1) ... [2019-01-01 20:11:14,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:14" (1/1) ... [2019-01-01 20:11:14,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 20:11:14,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 20:11:14,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 20:11:14,326 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 20:11:14,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:14" (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-01 20:11:14,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 20:11:14,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 20:11:14,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-01-01 20:11:14,389 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2019-01-01 20:11:14,389 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2019-01-01 20:11:14,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 20:11:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 20:11:14,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-01-01 20:11:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 20:11:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 20:11:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 20:11:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 20:11:14,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 20:11:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 20:11:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 20:11:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 20:11:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 20:11:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 20:11:14,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 20:11:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 20:11:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 20:11:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 20:11:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 20:11:14,392 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 20:11:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 20:11:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 20:11:14,393 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 20:11:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 20:11:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 20:11:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 20:11:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 20:11:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 20:11:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 20:11:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 20:11:14,394 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 20:11:14,395 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 20:11:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 20:11:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 20:11:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 20:11:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 20:11:14,397 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 20:11:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 20:11:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 20:11:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 20:11:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 20:11:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 20:11:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 20:11:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 20:11:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 20:11:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 20:11:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 20:11:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 20:11:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 20:11:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 20:11:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 20:11:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 20:11:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 20:11:14,400 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 20:11:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 20:11:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 20:11:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 20:11:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 20:11:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 20:11:14,402 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 20:11:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 20:11:14,403 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 20:11:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 20:11:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 20:11:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 20:11:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 20:11:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 20:11:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 20:11:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-01 20:11:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 20:11:14,404 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 20:11:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 20:11:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 20:11:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 20:11:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 20:11:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 20:11:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 20:11:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 20:11:14,406 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 20:11:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 20:11:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 20:11:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 20:11:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 20:11:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 20:11:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 20:11:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 20:11:14,407 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 20:11:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 20:11:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 20:11:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 20:11:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 20:11:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 20:11:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 20:11:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 20:11:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 20:11:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 20:11:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 20:11:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 20:11:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 20:11:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 20:11:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 20:11:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 20:11:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 20:11:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 20:11:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 20:11:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2019-01-01 20:11:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 20:11:14,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 20:11:14,414 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2019-01-01 20:11:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 20:11:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 20:11:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 20:11:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 20:11:14,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 20:11:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 20:11:14,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 20:11:15,186 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 20:11:15,187 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-01 20:11:15,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:11:15 BoogieIcfgContainer [2019-01-01 20:11:15,187 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 20:11:15,188 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 20:11:15,188 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 20:11:15,192 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 20:11:15,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 08:11:13" (1/3) ... [2019-01-01 20:11:15,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564f3892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:11:15, skipping insertion in model container [2019-01-01 20:11:15,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 08:11:14" (2/3) ... [2019-01-01 20:11:15,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@564f3892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 08:11:15, skipping insertion in model container [2019-01-01 20:11:15,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:11:15" (3/3) ... [2019-01-01 20:11:15,195 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2019-01-01 20:11:15,205 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 20:11:15,214 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-01 20:11:15,228 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-01 20:11:15,256 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 20:11:15,257 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 20:11:15,257 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 20:11:15,257 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 20:11:15,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 20:11:15,259 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 20:11:15,259 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 20:11:15,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 20:11:15,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 20:11:15,281 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-01 20:11:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:11:15,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:15,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:11:15,294 INFO L423 AbstractCegarLoop]: === Iteration 1 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash -777813511, now seen corresponding path program 1 times [2019-01-01 20:11:15,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:15,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:15,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:15,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:15,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:15,518 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-01 20:11:15,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:15,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:11:15,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:11:15,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:11:15,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:11:15,539 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-01-01 20:11:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:15,849 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-01-01 20:11:15,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:11:15,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-01 20:11:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:15,861 INFO L225 Difference]: With dead ends: 70 [2019-01-01 20:11:15,862 INFO L226 Difference]: Without dead ends: 66 [2019-01-01 20:11:15,864 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-01 20:11:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-01 20:11:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-01 20:11:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-01 20:11:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-01-01 20:11:15,907 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 9 [2019-01-01 20:11:15,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:15,907 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-01-01 20:11:15,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:11:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-01-01 20:11:15,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-01 20:11:15,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:15,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:11:15,909 INFO L423 AbstractCegarLoop]: === Iteration 2 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:15,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:15,909 INFO L82 PathProgramCache]: Analyzing trace with hash -777813510, now seen corresponding path program 1 times [2019-01-01 20:11:15,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:15,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:15,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:15,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:15,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:15,972 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-01 20:11:15,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:15,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 20:11:15,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 20:11:15,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 20:11:15,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 20:11:15,976 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 3 states. [2019-01-01 20:11:16,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:16,167 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-01-01 20:11:16,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 20:11:16,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-01 20:11:16,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:16,170 INFO L225 Difference]: With dead ends: 62 [2019-01-01 20:11:16,170 INFO L226 Difference]: Without dead ends: 62 [2019-01-01 20:11:16,171 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-01 20:11:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-01 20:11:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-01 20:11:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-01 20:11:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-01-01 20:11:16,180 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2019-01-01 20:11:16,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:16,180 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-01-01 20:11:16,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 20:11:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-01-01 20:11:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 20:11:16,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:16,182 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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-01 20:11:16,183 INFO L423 AbstractCegarLoop]: === Iteration 3 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:16,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash 682600898, now seen corresponding path program 1 times [2019-01-01 20:11:16,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:16,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:16,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 20:11:16,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:11:16,395 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-01 20:11:16,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:16,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:11:16,658 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-01 20:11:16,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:11:16,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 20:11:16,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:11:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:11:16,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:11:16,686 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2019-01-01 20:11:17,021 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 20:11:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:17,689 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2019-01-01 20:11:17,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 20:11:17,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-01-01 20:11:17,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:17,694 INFO L225 Difference]: With dead ends: 118 [2019-01-01 20:11:17,694 INFO L226 Difference]: Without dead ends: 118 [2019-01-01 20:11:17,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-01-01 20:11:17,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-01 20:11:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 69. [2019-01-01 20:11:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-01 20:11:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-01-01 20:11:17,713 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 47 [2019-01-01 20:11:17,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:17,713 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-01-01 20:11:17,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:11:17,714 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-01-01 20:11:17,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 20:11:17,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:17,716 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 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-01 20:11:17,717 INFO L423 AbstractCegarLoop]: === Iteration 4 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:17,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:17,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1975785787, now seen corresponding path program 1 times [2019-01-01 20:11:17,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:17,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:17,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:17,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:17,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-01 20:11:17,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:17,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:11:17,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:11:17,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:11:17,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:11:17,921 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 5 states. [2019-01-01 20:11:18,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:18,283 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-01-01 20:11:18,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:11:18,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-01-01 20:11:18,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:18,287 INFO L225 Difference]: With dead ends: 83 [2019-01-01 20:11:18,288 INFO L226 Difference]: Without dead ends: 83 [2019-01-01 20:11:18,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:11:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-01 20:11:18,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2019-01-01 20:11:18,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-01 20:11:18,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-01-01 20:11:18,297 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 50 [2019-01-01 20:11:18,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:18,298 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-01-01 20:11:18,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:11:18,298 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-01-01 20:11:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-01 20:11:18,300 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:18,300 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 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-01 20:11:18,301 INFO L423 AbstractCegarLoop]: === Iteration 5 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1975785786, now seen corresponding path program 1 times [2019-01-01 20:11:18,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:18,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:18,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 20:11:18,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:18,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 20:11:18,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 20:11:18,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 20:11:18,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:11:18,806 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 5 states. [2019-01-01 20:11:19,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:19,070 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-01-01 20:11:19,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:11:19,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-01-01 20:11:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:19,073 INFO L225 Difference]: With dead ends: 89 [2019-01-01 20:11:19,073 INFO L226 Difference]: Without dead ends: 89 [2019-01-01 20:11:19,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:11:19,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-01 20:11:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-01-01 20:11:19,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-01 20:11:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-01-01 20:11:19,081 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 50 [2019-01-01 20:11:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:19,082 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-01-01 20:11:19,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 20:11:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-01-01 20:11:19,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 20:11:19,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:19,084 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-01 20:11:19,085 INFO L423 AbstractCegarLoop]: === Iteration 6 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:19,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:19,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1173083155, now seen corresponding path program 1 times [2019-01-01 20:11:19,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:19,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:19,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:19,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:19,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 20:11:19,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:19,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 20:11:19,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 20:11:19,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 20:11:19,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:11:19,378 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 7 states. [2019-01-01 20:11:19,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:19,701 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-01-01 20:11:19,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 20:11:19,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-01-01 20:11:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:19,708 INFO L225 Difference]: With dead ends: 89 [2019-01-01 20:11:19,709 INFO L226 Difference]: Without dead ends: 89 [2019-01-01 20:11:19,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:11:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-01 20:11:19,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-01-01 20:11:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-01 20:11:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-01-01 20:11:19,717 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 55 [2019-01-01 20:11:19,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:19,717 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-01-01 20:11:19,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 20:11:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-01-01 20:11:19,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-01 20:11:19,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:19,720 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 20:11:19,720 INFO L423 AbstractCegarLoop]: === Iteration 7 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:19,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash -13160950, now seen corresponding path program 1 times [2019-01-01 20:11:19,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:19,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:19,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:19,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-01 20:11:20,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:20,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:11:20,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:11:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:11:20,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:11:20,140 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 6 states. [2019-01-01 20:11:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:20,334 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-01-01 20:11:20,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:11:20,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-01 20:11:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:20,338 INFO L225 Difference]: With dead ends: 89 [2019-01-01 20:11:20,338 INFO L226 Difference]: Without dead ends: 89 [2019-01-01 20:11:20,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:11:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-01 20:11:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2019-01-01 20:11:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-01 20:11:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-01-01 20:11:20,346 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 57 [2019-01-01 20:11:20,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:20,347 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-01-01 20:11:20,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:11:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-01-01 20:11:20,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-01 20:11:20,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:20,349 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 20:11:20,349 INFO L423 AbstractCegarLoop]: === Iteration 8 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:20,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:20,350 INFO L82 PathProgramCache]: Analyzing trace with hash -13160949, now seen corresponding path program 1 times [2019-01-01 20:11:20,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:20,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:20,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:20,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:20,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 20:11:20,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:20,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 20:11:20,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-01 20:11:20,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 20:11:20,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-01 20:11:20,648 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 8 states. [2019-01-01 20:11:21,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:21,045 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2019-01-01 20:11:21,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 20:11:21,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-01-01 20:11:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:21,048 INFO L225 Difference]: With dead ends: 117 [2019-01-01 20:11:21,048 INFO L226 Difference]: Without dead ends: 117 [2019-01-01 20:11:21,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-01 20:11:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-01 20:11:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2019-01-01 20:11:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-01 20:11:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2019-01-01 20:11:21,056 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 57 [2019-01-01 20:11:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:21,056 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2019-01-01 20:11:21,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-01 20:11:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2019-01-01 20:11:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-01 20:11:21,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:21,059 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2019-01-01 20:11:21,059 INFO L423 AbstractCegarLoop]: === Iteration 9 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:21,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash 37376632, now seen corresponding path program 1 times [2019-01-01 20:11:21,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:21,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:21,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:21,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:21,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:21,661 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 20:11:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 20:11:21,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:11:21,885 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-01 20:11:21,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:21,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:11:22,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:11:22,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:11:22,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-01-01 20:11:22,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:22,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:22,629 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 23 treesize of output 39 [2019-01-01 20:11:22,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-01-01 20:11:22,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-01 20:11:22,746 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-01 20:11:22,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:22,863 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-01 20:11:22,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2019-01-01 20:11:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 20:11:22,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:11:22,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-01-01 20:11:22,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-01 20:11:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-01 20:11:22,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-01-01 20:11:22,983 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 21 states. [2019-01-01 20:11:24,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:24,549 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-01-01 20:11:24,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 20:11:24,550 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-01-01 20:11:24,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:24,552 INFO L225 Difference]: With dead ends: 116 [2019-01-01 20:11:24,552 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 20:11:24,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2019-01-01 20:11:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 20:11:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2019-01-01 20:11:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-01 20:11:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-01-01 20:11:24,560 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 57 [2019-01-01 20:11:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:24,560 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-01-01 20:11:24,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-01 20:11:24,561 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-01-01 20:11:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-01 20:11:24,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:24,562 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2019-01-01 20:11:24,562 INFO L423 AbstractCegarLoop]: === Iteration 10 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash 37376633, now seen corresponding path program 1 times [2019-01-01 20:11:24,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:24,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:24,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:24,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:24,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 20:11:25,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:11:25,507 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-01 20:11:25,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:25,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:11:25,622 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-01 20:11:25,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 20:11:25,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:11:25,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:11:25,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:11:25,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 10 treesize of output 9 [2019-01-01 20:11:25,762 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-01-01 20:11:25,878 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 17 [2019-01-01 20:11:25,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2019-01-01 20:11:25,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-01 20:11:25,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-01 20:11:25,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:25,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 20:11:26,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-01 20:11:26,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:26,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:26,023 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-01 20:11:26,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:14 [2019-01-01 20:11:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 20:11:26,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:11:26,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2019-01-01 20:11:26,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-01 20:11:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-01 20:11:26,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-01-01 20:11:26,080 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 22 states. [2019-01-01 20:11:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:28,722 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2019-01-01 20:11:28,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 20:11:28,723 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-01-01 20:11:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:28,725 INFO L225 Difference]: With dead ends: 120 [2019-01-01 20:11:28,725 INFO L226 Difference]: Without dead ends: 120 [2019-01-01 20:11:28,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=248, Invalid=1158, Unknown=0, NotChecked=0, Total=1406 [2019-01-01 20:11:28,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-01 20:11:28,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2019-01-01 20:11:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 20:11:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-01-01 20:11:28,742 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 57 [2019-01-01 20:11:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:28,742 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-01-01 20:11:28,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-01 20:11:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-01-01 20:11:28,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-01 20:11:28,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:28,750 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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] [2019-01-01 20:11:28,751 INFO L423 AbstractCegarLoop]: === Iteration 11 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1490294810, now seen corresponding path program 1 times [2019-01-01 20:11:28,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:28,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:28,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:28,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:28,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:29,339 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2019-01-01 20:11:29,690 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-01 20:11:30,062 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-01 20:11:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 20:11:30,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:11:30,522 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-01 20:11:30,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:30,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:11:30,957 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 21 treesize of output 18 [2019-01-01 20:11:30,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:11:30,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:30,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:30,990 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 21 treesize of output 18 [2019-01-01 20:11:30,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:11:30,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:30,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:31,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:11:31,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:23 [2019-01-01 20:11:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 20:11:31,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:11:31,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2019-01-01 20:11:31,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-01 20:11:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-01 20:11:31,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-01-01 20:11:31,277 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 23 states. [2019-01-01 20:11:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:32,704 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2019-01-01 20:11:32,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-01 20:11:32,705 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-01-01 20:11:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:32,707 INFO L225 Difference]: With dead ends: 116 [2019-01-01 20:11:32,707 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 20:11:32,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=0, NotChecked=0, Total=1482 [2019-01-01 20:11:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 20:11:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-01-01 20:11:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-01 20:11:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-01-01 20:11:32,715 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 62 [2019-01-01 20:11:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:32,716 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-01-01 20:11:32,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-01 20:11:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-01-01 20:11:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-01 20:11:32,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:32,720 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:11:32,720 INFO L423 AbstractCegarLoop]: === Iteration 12 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:32,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:32,720 INFO L82 PathProgramCache]: Analyzing trace with hash -307445000, now seen corresponding path program 1 times [2019-01-01 20:11:32,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:32,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:32,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:32,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:32,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-01 20:11:33,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:11:33,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 20:11:33,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 20:11:33,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 20:11:33,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 20:11:33,246 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 6 states. [2019-01-01 20:11:33,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:33,482 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-01-01 20:11:33,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 20:11:33,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-01-01 20:11:33,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:33,484 INFO L225 Difference]: With dead ends: 100 [2019-01-01 20:11:33,484 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 20:11:33,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 20:11:33,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 20:11:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2019-01-01 20:11:33,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-01 20:11:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2019-01-01 20:11:33,489 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 64 [2019-01-01 20:11:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:33,489 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2019-01-01 20:11:33,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 20:11:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2019-01-01 20:11:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-01 20:11:33,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:33,490 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-01 20:11:33,491 INFO L423 AbstractCegarLoop]: === Iteration 13 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:33,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:33,491 INFO L82 PathProgramCache]: Analyzing trace with hash -256907419, now seen corresponding path program 2 times [2019-01-01 20:11:33,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:33,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:33,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:33,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:11:33,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:34,353 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 20:11:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:11:34,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:11:34,686 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-01 20:11:34,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:11:34,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:11:34,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:11:34,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:11:35,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:11:35,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:11:35,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:35,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:35,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:35,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-01-01 20:11:35,156 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 17 [2019-01-01 20:11:35,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:35,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:35,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-01-01 20:11:35,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:35,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:35,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:35,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2019-01-01 20:11:35,337 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-01 20:11:35,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:11:35,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:11:35,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:11:35,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:35,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:35,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:11:35,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2019-01-01 20:11:36,223 WARN L181 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 20:11:36,893 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 20:11:36,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:36,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:36,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:36,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2019-01-01 20:11:36,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:36,932 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 38 treesize of output 39 [2019-01-01 20:11:36,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:11:36,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:36,958 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 16 treesize of output 23 [2019-01-01 20:11:36,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:36,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:36,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:36,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:36,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:62 [2019-01-01 20:11:37,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-01-01 20:11:37,148 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-01 20:11:37,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:37,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:37,168 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-01 20:11:37,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:54 [2019-01-01 20:11:37,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:37,417 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 50 treesize of output 41 [2019-01-01 20:11:37,444 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 20:11:37,445 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 23 treesize of output 15 [2019-01-01 20:11:37,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:37,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-01-01 20:11:37,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:11:37,476 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-01 20:11:37,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 20:11:37,492 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:24 [2019-01-01 20:11:37,629 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:11:37,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:11:37,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 35 [2019-01-01 20:11:37,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-01 20:11:37,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-01 20:11:37,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2019-01-01 20:11:37,663 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 36 states. [2019-01-01 20:11:39,664 WARN L181 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-01-01 20:11:40,745 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-01 20:11:43,174 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-01 20:11:44,336 WARN L181 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-01-01 20:11:46,566 WARN L181 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-01 20:11:47,760 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-01-01 20:11:50,369 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-01-01 20:11:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:11:51,500 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2019-01-01 20:11:51,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 20:11:51,501 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 64 [2019-01-01 20:11:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:11:51,502 INFO L225 Difference]: With dead ends: 132 [2019-01-01 20:11:51,502 INFO L226 Difference]: Without dead ends: 132 [2019-01-01 20:11:51,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=468, Invalid=2954, Unknown=0, NotChecked=0, Total=3422 [2019-01-01 20:11:51,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-01 20:11:51,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 106. [2019-01-01 20:11:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 20:11:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2019-01-01 20:11:51,509 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 64 [2019-01-01 20:11:51,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:11:51,511 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2019-01-01 20:11:51,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-01 20:11:51,511 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2019-01-01 20:11:51,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-01 20:11:51,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:11:51,512 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2019-01-01 20:11:51,512 INFO L423 AbstractCegarLoop]: === Iteration 14 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:11:51,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:11:51,512 INFO L82 PathProgramCache]: Analyzing trace with hash -256907418, now seen corresponding path program 2 times [2019-01-01 20:11:51,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:11:51,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:11:51,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:51,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:11:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:11:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:11:52,793 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 20:11:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:11:53,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:11:53,418 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-01 20:11:53,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:11:53,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:11:53,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:11:53,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:11:53,520 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-01 20:11:53,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:53,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:53,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 20:11:53,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:11:53,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:11:53,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:53,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:53,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:11:53,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:11:53,757 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:53,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:53,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:53,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2019-01-01 20:11:53,926 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 17 [2019-01-01 20:11:53,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:53,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:53,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:34 [2019-01-01 20:11:54,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:54,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:54,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:54,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:54,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:54,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2019-01-01 20:11:54,376 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-01 20:11:54,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:11:54,401 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-01 20:11:54,409 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:11:54,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 20:11:54,424 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:47 [2019-01-01 20:11:57,965 WARN L181 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 20:11:59,397 WARN L181 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 20:11:59,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:59,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-01 20:11:59,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:59,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:59,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:59,459 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-01 20:11:59,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:59,486 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 27 [2019-01-01 20:11:59,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:11:59,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:59,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-01 20:11:59,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:59,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:59,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:59,541 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 24 treesize of output 31 [2019-01-01 20:11:59,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:11:59,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:11:59,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 20:11:59,549 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 20:11:59,554 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:59,563 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:59,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:11:59,587 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:73, output treesize:67 [2019-01-01 20:12:00,095 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 76 treesize of output 61 [2019-01-01 20:12:00,098 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 20:12:00,099 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 15 [2019-01-01 20:12:00,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:12:00,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2019-01-01 20:12:00,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:12:00,120 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-01 20:12:00,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-01 20:12:00,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2019-01-01 20:12:00,139 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:12:00,145 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-01 20:12:00,145 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 20:12:00,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:12:00,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 20:12:00,157 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:23 [2019-01-01 20:12:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 35 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:12:00,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:12:00,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 40 [2019-01-01 20:12:00,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-01 20:12:00,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-01 20:12:00,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1497, Unknown=2, NotChecked=0, Total=1640 [2019-01-01 20:12:00,313 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 41 states. [2019-01-01 20:12:04,498 WARN L181 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-01-01 20:12:12,841 WARN L181 SmtUtils]: Spent 8.27 s on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-01-01 20:12:15,842 WARN L181 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-01-01 20:12:19,902 WARN L181 SmtUtils]: Spent 3.55 s on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-01-01 20:12:28,262 WARN L181 SmtUtils]: Spent 8.28 s on a formula simplification. DAG size of input: 95 DAG size of output: 68 [2019-01-01 20:12:28,788 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-01-01 20:12:32,566 WARN L181 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-01-01 20:12:41,356 WARN L181 SmtUtils]: Spent 8.73 s on a formula simplification. DAG size of input: 106 DAG size of output: 77 [2019-01-01 20:12:41,861 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-01-01 20:12:45,599 WARN L181 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-01-01 20:12:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:12:47,100 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2019-01-01 20:12:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 20:12:47,103 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 64 [2019-01-01 20:12:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:12:47,104 INFO L225 Difference]: With dead ends: 136 [2019-01-01 20:12:47,105 INFO L226 Difference]: Without dead ends: 136 [2019-01-01 20:12:47,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=611, Invalid=3943, Unknown=2, NotChecked=0, Total=4556 [2019-01-01 20:12:47,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-01 20:12:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2019-01-01 20:12:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 20:12:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-01-01 20:12:47,111 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 64 [2019-01-01 20:12:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:12:47,112 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-01-01 20:12:47,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-01 20:12:47,112 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-01-01 20:12:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-01 20:12:47,113 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:12:47,113 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 20:12:47,113 INFO L423 AbstractCegarLoop]: === Iteration 15 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:12:47,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:12:47,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1158408333, now seen corresponding path program 1 times [2019-01-01 20:12:47,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:12:47,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:12:47,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:12:47,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:12:47,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:12:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:12:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 20:12:47,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:12:47,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 20:12:47,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 20:12:47,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 20:12:47,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 20:12:47,267 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 4 states. [2019-01-01 20:12:47,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:12:47,353 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2019-01-01 20:12:47,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 20:12:47,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-01-01 20:12:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:12:47,357 INFO L225 Difference]: With dead ends: 110 [2019-01-01 20:12:47,357 INFO L226 Difference]: Without dead ends: 110 [2019-01-01 20:12:47,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 20:12:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-01 20:12:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-01 20:12:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 20:12:47,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-01-01 20:12:47,362 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 68 [2019-01-01 20:12:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:12:47,362 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-01-01 20:12:47,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 20:12:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-01-01 20:12:47,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-01 20:12:47,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:12:47,363 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 20:12:47,364 INFO L423 AbstractCegarLoop]: === Iteration 16 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:12:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:12:47,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1294438221, now seen corresponding path program 2 times [2019-01-01 20:12:47,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:12:47,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:12:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:12:47,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:12:47,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:12:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:12:47,925 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-01 20:12:48,127 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-01 20:12:49,077 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2019-01-01 20:12:49,747 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-01 20:12:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:12:50,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:12:50,636 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-01 20:12:50,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 20:12:50,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 20:12:50,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:12:50,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:12:50,945 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 26 treesize of output 23 [2019-01-01 20:12:50,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:12:50,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:12:50,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:12:50,983 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 26 treesize of output 23 [2019-01-01 20:12:50,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:12:50,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:12:50,995 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:12:51,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:12:51,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:33 [2019-01-01 20:12:51,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:12:51,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:12:51,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:12:51,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:30 [2019-01-01 20:12:51,544 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-01 20:12:51,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:12:51,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:12:51,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:12:51,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:12:51,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:12:51,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:12:51,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:34 [2019-01-01 20:12:52,813 WARN L181 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 20:12:53,443 WARN L181 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 20:12:53,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:12:53,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:12:53,450 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-01 20:12:53,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:12:53,471 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 25 treesize of output 26 [2019-01-01 20:12:53,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:12:53,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:12:53,480 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 16 treesize of output 23 [2019-01-01 20:12:53,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:12:53,488 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:12:53,494 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:12:53,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:12:53,507 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2019-01-01 20:12:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:12:54,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:12:54,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 23] total 58 [2019-01-01 20:12:54,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-01 20:12:54,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-01 20:12:54,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3083, Unknown=1, NotChecked=0, Total=3306 [2019-01-01 20:12:54,089 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 58 states. [2019-01-01 20:12:57,845 WARN L181 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-01-01 20:13:02,400 WARN L181 SmtUtils]: Spent 4.45 s on a formula simplification. DAG size of input: 126 DAG size of output: 56 [2019-01-01 20:13:04,467 WARN L181 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 87 DAG size of output: 38 [2019-01-01 20:13:04,797 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2019-01-01 20:13:04,994 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-01-01 20:13:06,400 WARN L181 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 92 DAG size of output: 46 [2019-01-01 20:13:11,249 WARN L181 SmtUtils]: Spent 4.74 s on a formula simplification. DAG size of input: 134 DAG size of output: 64 [2019-01-01 20:13:11,854 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-01-01 20:13:13,376 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-01-01 20:13:15,016 WARN L181 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2019-01-01 20:13:15,693 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-01-01 20:13:16,055 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-01-01 20:13:16,277 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-01-01 20:13:16,469 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-01-01 20:13:16,886 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-01-01 20:13:17,825 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-01-01 20:13:18,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:13:18,633 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2019-01-01 20:13:18,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-01 20:13:18,635 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 69 [2019-01-01 20:13:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:13:18,636 INFO L225 Difference]: With dead ends: 159 [2019-01-01 20:13:18,636 INFO L226 Difference]: Without dead ends: 159 [2019-01-01 20:13:18,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=1272, Invalid=7847, Unknown=1, NotChecked=0, Total=9120 [2019-01-01 20:13:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-01 20:13:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2019-01-01 20:13:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-01 20:13:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-01-01 20:13:18,645 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 69 [2019-01-01 20:13:18,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:13:18,646 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-01-01 20:13:18,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-01 20:13:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-01-01 20:13:18,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-01 20:13:18,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:13:18,647 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01 20:13:18,647 INFO L423 AbstractCegarLoop]: === Iteration 17 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:13:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:13:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash 80529935, now seen corresponding path program 1 times [2019-01-01 20:13:18,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:13:18,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:13:18,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:13:18,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:13:18,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:13:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:13:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-01-01 20:13:18,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 20:13:18,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 20:13:18,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 20:13:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 20:13:18,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-01 20:13:18,857 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 12 states. [2019-01-01 20:13:19,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:13:19,223 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-01-01 20:13:19,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 20:13:19,224 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-01-01 20:13:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:13:19,226 INFO L225 Difference]: With dead ends: 110 [2019-01-01 20:13:19,226 INFO L226 Difference]: Without dead ends: 104 [2019-01-01 20:13:19,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-01-01 20:13:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-01 20:13:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-01 20:13:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 20:13:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-01-01 20:13:19,230 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 71 [2019-01-01 20:13:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:13:19,231 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-01-01 20:13:19,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 20:13:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-01-01 20:13:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-01 20:13:19,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:13:19,235 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-01 20:13:19,235 INFO L423 AbstractCegarLoop]: === Iteration 18 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:13:19,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:13:19,237 INFO L82 PathProgramCache]: Analyzing trace with hash 503471576, now seen corresponding path program 3 times [2019-01-01 20:13:19,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:13:19,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:13:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:13:19,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 20:13:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:13:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:13:19,895 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2019-01-01 20:13:20,110 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2019-01-01 20:13:20,354 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-01 20:13:20,935 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-01-01 20:13:21,755 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-01-01 20:13:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:13:22,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:13:22,627 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-01 20:13:22,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:13:22,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:13:22,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:13:22,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:13:23,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:13:23,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:13:23,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-01-01 20:13:23,287 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 17 [2019-01-01 20:13:23,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-01-01 20:13:23,315 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-01 20:13:23,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2019-01-01 20:13:23,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2019-01-01 20:13:23,850 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-01 20:13:23,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:13:23,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:13:23,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:13:23,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:23,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:13:23,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:45 [2019-01-01 20:13:24,508 WARN L181 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 20:13:25,110 WARN L181 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 20:13:25,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:25,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:25,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:25,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2019-01-01 20:13:25,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:25,163 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 38 treesize of output 39 [2019-01-01 20:13:25,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:13:25,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:25,173 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 16 treesize of output 23 [2019-01-01 20:13:25,174 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:25,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:25,191 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:25,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:25,215 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:67 [2019-01-01 20:13:25,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:25,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:25,622 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:25,626 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:25,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:25,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:57 [2019-01-01 20:13:25,650 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-01 20:13:25,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:13:25,683 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-01 20:13:25,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:13:25,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 20:13:25,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:53 [2019-01-01 20:13:29,551 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 20:13:30,947 WARN L181 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 20:13:30,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:31,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:31,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:31,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:31,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:31,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-01 20:13:31,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:31,060 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 12 treesize of output 15 [2019-01-01 20:13:31,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:31,112 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 24 treesize of output 25 [2019-01-01 20:13:31,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:13:31,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:31,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 20:13:31,130 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:31,144 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:31,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:31,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:31,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:31,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:31,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 109 [2019-01-01 20:13:31,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-01 20:13:31,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:31,242 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 42 treesize of output 43 [2019-01-01 20:13:31,242 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:31,260 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:31,287 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:31,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:31,328 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:108, output treesize:140 [2019-01-01 20:13:32,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:32,120 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 68 treesize of output 56 [2019-01-01 20:13:32,123 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 43 treesize of output 26 [2019-01-01 20:13:32,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:32,135 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-01 20:13:32,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:32,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:13:32,160 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-01 20:13:32,161 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:168, output treesize:115 [2019-01-01 20:13:32,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:32,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:32,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:32,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 treesize of output 40 [2019-01-01 20:13:32,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:32,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:32,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:32,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:32,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:32,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:13:32,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 85 [2019-01-01 20:13:32,574 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2019-01-01 20:13:32,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-01 20:13:32,610 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 20:13:32,611 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 33 treesize of output 21 [2019-01-01 20:13:32,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:13:32,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2019-01-01 20:13:32,640 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-01 20:13:32,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2019-01-01 20:13:32,651 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 20:13:32,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2019-01-01 20:13:32,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-01 20:13:32,755 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:142, output treesize:124 [2019-01-01 20:13:33,056 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:13:33,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:13:33,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 53 [2019-01-01 20:13:33,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-01 20:13:33,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-01 20:13:33,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2629, Unknown=2, NotChecked=0, Total=2862 [2019-01-01 20:13:33,078 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 54 states. [2019-01-01 20:13:37,204 WARN L181 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-01-01 20:13:40,514 WARN L181 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-01-01 20:13:44,820 WARN L181 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-01-01 20:13:48,383 WARN L181 SmtUtils]: Spent 3.37 s on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-01-01 20:13:53,140 WARN L181 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-01-01 20:13:56,797 WARN L181 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-01-01 20:14:07,199 WARN L181 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-01-01 20:14:10,911 WARN L181 SmtUtils]: Spent 3.65 s on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-01-01 20:14:11,544 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-01 20:14:12,657 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-01 20:14:13,185 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2019-01-01 20:14:13,386 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-01-01 20:14:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:14:14,256 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2019-01-01 20:14:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-01 20:14:14,257 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 71 [2019-01-01 20:14:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:14:14,259 INFO L225 Difference]: With dead ends: 129 [2019-01-01 20:14:14,259 INFO L226 Difference]: Without dead ends: 129 [2019-01-01 20:14:14,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 46 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 44.6s TimeCoverageRelationStatistics Valid=745, Invalid=5733, Unknown=2, NotChecked=0, Total=6480 [2019-01-01 20:14:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-01 20:14:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-01-01 20:14:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 20:14:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2019-01-01 20:14:14,265 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 71 [2019-01-01 20:14:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:14:14,266 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2019-01-01 20:14:14,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-01 20:14:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2019-01-01 20:14:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-01 20:14:14,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:14:14,267 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-01 20:14:14,267 INFO L423 AbstractCegarLoop]: === Iteration 19 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:14:14,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:14:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash 503471577, now seen corresponding path program 3 times [2019-01-01 20:14:14,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:14:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:14:14,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:14:14,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:14:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:14:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:14:14,696 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-01 20:14:16,010 WARN L181 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2019-01-01 20:14:16,757 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-01 20:14:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 62 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:14:18,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:14:18,216 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-01 20:14:18,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:14:18,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:14:18,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:14:18,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:14:18,383 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-01 20:14:18,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:18,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:18,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 20:14:18,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:14:18,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:14:18,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:18,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:18,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:14:18,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:14:18,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:18,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:18,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:18,592 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-01-01 20:14:18,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:18,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:18,763 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 23 treesize of output 39 [2019-01-01 20:14:18,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:18,780 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 27 [2019-01-01 20:14:18,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:18,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:18,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:55 [2019-01-01 20:14:19,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:19,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:19,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:19,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:19,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:19,162 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:57 [2019-01-01 20:14:19,164 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-01 20:14:19,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:14:19,191 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-01 20:14:19,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:14:19,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 20:14:19,211 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:53 [2019-01-01 20:14:27,771 WARN L181 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 20:14:30,200 WARN L181 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 20:14:30,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:30,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:30,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:30,216 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 50 [2019-01-01 20:14:30,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:30,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2019-01-01 20:14:30,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:30,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:30,300 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 51 treesize of output 66 [2019-01-01 20:14:30,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-01 20:14:30,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:30,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2019-01-01 20:14:30,309 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:30,317 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:30,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:30,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:30,371 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 24 treesize of output 31 [2019-01-01 20:14:30,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:14:30,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:30,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 20:14:30,380 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:30,460 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:30,483 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:30,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:30,516 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:96, output treesize:122 [2019-01-01 20:14:31,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:31,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:31,766 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:31,770 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:31,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:31,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2019-01-01 20:14:31,791 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-01 20:14:31,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:14:31,817 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-01 20:14:31,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:14:31,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 20:14:31,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2019-01-01 20:14:48,050 WARN L181 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 20:14:50,461 WARN L181 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 20:14:50,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,583 INFO L303 Elim1Store]: Index analysis took 117 ms [2019-01-01 20:14:50,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2019-01-01 20:14:50,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:50,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2019-01-01 20:14:50,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:50,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 134 [2019-01-01 20:14:50,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-01 20:14:50,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,731 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 42 treesize of output 43 [2019-01-01 20:14:50,731 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:50,741 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:50,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:50,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 58 [2019-01-01 20:14:50,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:14:50,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:50,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 20:14:50,844 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:50,851 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:50,865 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:50,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:50,900 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:147, output treesize:163 [2019-01-01 20:14:52,045 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 20:14:52,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:52,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:52,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:52,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:52,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:52,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:14:52,127 INFO L303 Elim1Store]: Index analysis took 123 ms [2019-01-01 20:14:52,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 190 [2019-01-01 20:14:52,138 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 20:14:52,162 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 103 [2019-01-01 20:14:52,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2019-01-01 20:14:52,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 83 [2019-01-01 20:14:52,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:14:52,263 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 20:14:52,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 53 [2019-01-01 20:14:52,265 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-01 20:14:52,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 20:14:52,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-01-01 20:14:52,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 5 [2019-01-01 20:14:52,330 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:52,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-01 20:14:52,341 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:52,348 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-01 20:14:52,349 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 20:14:52,352 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:14:52,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 20:14:52,372 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:227, output treesize:48 [2019-01-01 20:14:52,661 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 20:14:52,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:14:52,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 50 [2019-01-01 20:14:52,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-01 20:14:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-01 20:14:52,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2342, Unknown=19, NotChecked=0, Total=2550 [2019-01-01 20:14:52,681 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 51 states. [2019-01-01 20:14:57,952 WARN L181 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-01-01 20:15:01,414 WARN L181 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-01-01 20:15:07,083 WARN L181 SmtUtils]: Spent 4.95 s on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-01-01 20:15:10,624 WARN L181 SmtUtils]: Spent 3.41 s on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-01-01 20:15:15,708 WARN L181 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-01-01 20:15:19,319 WARN L181 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-01-01 20:15:25,059 WARN L181 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-01-01 20:15:28,936 WARN L181 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-01-01 20:15:29,410 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-01-01 20:15:29,729 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2019-01-01 20:15:30,328 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2019-01-01 20:15:30,585 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-01-01 20:15:31,151 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-01-01 20:15:31,406 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-01-01 20:15:31,894 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2019-01-01 20:15:32,146 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-01-01 20:15:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:15:33,601 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2019-01-01 20:15:33,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-01 20:15:33,603 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 71 [2019-01-01 20:15:33,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:15:33,604 INFO L225 Difference]: With dead ends: 130 [2019-01-01 20:15:33,605 INFO L226 Difference]: Without dead ends: 130 [2019-01-01 20:15:33,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 13 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1539 ImplicationChecksByTransitivity, 72.5s TimeCoverageRelationStatistics Valid=695, Invalid=5448, Unknown=19, NotChecked=0, Total=6162 [2019-01-01 20:15:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-01 20:15:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2019-01-01 20:15:33,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-01 20:15:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2019-01-01 20:15:33,611 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 71 [2019-01-01 20:15:33,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:15:33,611 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2019-01-01 20:15:33,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-01 20:15:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2019-01-01 20:15:33,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-01 20:15:33,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:15:33,612 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-01 20:15:33,613 INFO L423 AbstractCegarLoop]: === Iteration 20 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:15:33,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:15:33,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1020516166, now seen corresponding path program 3 times [2019-01-01 20:15:33,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:15:33,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:15:33,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:15:33,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:15:33,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:15:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:15:35,755 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-01 20:15:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:15:37,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:15:37,155 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-01 20:15:37,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 20:15:37,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-01 20:15:37,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:15:37,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:15:37,498 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-01 20:15:37,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-01 20:15:37,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:15:37,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:15:37,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-01 20:15:37,778 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-01 20:15:37,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2019-01-01 20:15:37,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2019-01-01 20:15:37,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:15:37,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:15:37,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:37,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:38,017 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-01 20:15:38,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:15:38,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:15:38,034 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:45 [2019-01-01 20:15:38,641 WARN L181 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 20:15:39,241 WARN L181 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-01 20:15:39,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:15:39,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:15:39,259 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-01 20:15:39,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:39,291 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 33 treesize of output 34 [2019-01-01 20:15:39,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:15:39,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:15:39,302 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 16 treesize of output 23 [2019-01-01 20:15:39,302 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:39,313 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:39,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:39,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:39,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:66 [2019-01-01 20:15:39,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:39,817 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:39,841 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:39,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:39,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:39,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2019-01-01 20:15:39,863 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-01 20:15:39,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:15:39,885 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-01 20:15:39,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:15:39,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 20:15:39,904 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2019-01-01 20:15:42,833 WARN L181 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 20:15:44,470 WARN L181 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 20:15:44,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:15:44,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:15:44,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:15:44,504 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-01 20:15:44,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:44,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-01 20:15:44,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:44,590 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 42 treesize of output 43 [2019-01-01 20:15:44,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:15:44,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:15:44,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 20:15:44,606 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:44,617 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:44,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:44,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:15:44,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2019-01-01 20:15:44,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-01 20:15:44,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:15:44,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2019-01-01 20:15:44,711 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 20:15:44,718 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:44,732 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:44,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:15:44,761 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:99, output treesize:106 [2019-01-01 20:15:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:15:46,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:15:46,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 29] total 73 [2019-01-01 20:15:46,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-01 20:15:46,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-01 20:15:46,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=5013, Unknown=2, NotChecked=0, Total=5256 [2019-01-01 20:15:46,334 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 73 states. [2019-01-01 20:15:48,343 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-01-01 20:15:51,589 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-01-01 20:15:55,988 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2019-01-01 20:16:06,076 WARN L181 SmtUtils]: Spent 4.81 s on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2019-01-01 20:16:11,938 WARN L181 SmtUtils]: Spent 5.65 s on a formula simplification. DAG size of input: 219 DAG size of output: 68 [2019-01-01 20:16:17,974 WARN L181 SmtUtils]: Spent 5.68 s on a formula simplification. DAG size of input: 175 DAG size of output: 65 [2019-01-01 20:16:19,707 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2019-01-01 20:16:23,042 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-01-01 20:16:24,145 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2019-01-01 20:16:28,190 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 72 [2019-01-01 20:16:32,945 WARN L181 SmtUtils]: Spent 2.61 s on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2019-01-01 20:16:39,276 WARN L181 SmtUtils]: Spent 4.19 s on a formula simplification. DAG size of input: 201 DAG size of output: 51 [2019-01-01 20:16:44,420 WARN L181 SmtUtils]: Spent 4.98 s on a formula simplification. DAG size of input: 134 DAG size of output: 72 [2019-01-01 20:16:44,941 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-01-01 20:16:45,999 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 42 [2019-01-01 20:16:46,316 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-01-01 20:16:47,766 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-01-01 20:16:49,946 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 68 [2019-01-01 20:16:53,993 WARN L181 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 78 [2019-01-01 20:16:59,020 WARN L181 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 115 DAG size of output: 55 [2019-01-01 20:17:04,855 WARN L181 SmtUtils]: Spent 5.57 s on a formula simplification. DAG size of input: 209 DAG size of output: 60 [2019-01-01 20:17:05,839 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2019-01-01 20:17:07,111 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 54 [2019-01-01 20:17:10,967 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 64 [2019-01-01 20:17:11,659 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 65 [2019-01-01 20:17:12,016 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 66 [2019-01-01 20:17:12,548 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 70 [2019-01-01 20:17:12,919 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 69 [2019-01-01 20:17:13,277 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 70 [2019-01-01 20:17:13,818 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 78 [2019-01-01 20:17:14,209 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 69 [2019-01-01 20:17:14,592 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 70 [2019-01-01 20:17:15,135 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 74 [2019-01-01 20:17:15,486 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 70 [2019-01-01 20:17:15,835 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 71 [2019-01-01 20:17:16,378 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2019-01-01 20:17:17,053 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-01-01 20:17:18,150 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-01-01 20:17:18,682 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2019-01-01 20:17:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:17:19,114 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2019-01-01 20:17:19,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-01 20:17:19,116 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 76 [2019-01-01 20:17:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:17:19,118 INFO L225 Difference]: With dead ends: 166 [2019-01-01 20:17:19,118 INFO L226 Difference]: Without dead ends: 166 [2019-01-01 20:17:19,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3957 ImplicationChecksByTransitivity, 74.7s TimeCoverageRelationStatistics Valid=1862, Invalid=14125, Unknown=15, NotChecked=0, Total=16002 [2019-01-01 20:17:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-01 20:17:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2019-01-01 20:17:19,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-01 20:17:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-01-01 20:17:19,126 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 76 [2019-01-01 20:17:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:17:19,126 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-01-01 20:17:19,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-01 20:17:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-01-01 20:17:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-01 20:17:19,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 20:17:19,127 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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-01 20:17:19,128 INFO L423 AbstractCegarLoop]: === Iteration 21 === [insert_listErr1REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr2REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, search_listErr3REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION]=== [2019-01-01 20:17:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 20:17:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash 625364997, now seen corresponding path program 4 times [2019-01-01 20:17:19,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 20:17:19,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 20:17:19,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:17:19,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 20:17:19,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 20:17:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 20:17:19,903 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-01-01 20:17:21,112 WARN L181 SmtUtils]: Spent 595.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-01-01 20:17:22,320 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2019-01-01 20:17:23,409 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-01-01 20:17:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 11 proven. 83 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 20:17:24,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 20:17:24,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 20:17:24,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 20:17:25,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 20:17:25,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 20:17:25,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 20:17:25,092 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-01 20:17:25,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:25,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:25,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-01 20:17:25,112 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-01 20:17:25,115 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-01 20:17:25,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:25,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:25,142 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-01 20:17:25,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2019-01-01 20:17:25,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2019-01-01 20:17:25,155 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 7 [2019-01-01 20:17:25,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:25,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:25,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:25,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-01-01 20:17:26,852 WARN L181 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 20:17:26,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:17:26,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:17:26,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:26,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:26,884 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-01 20:17:26,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 [2019-01-01 20:17:27,615 WARN L181 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 20:17:28,309 WARN L181 SmtUtils]: Spent 528.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-01 20:17:28,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:28,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:28,319 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 23 treesize of output 39 [2019-01-01 20:17:28,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:28,343 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 27 [2019-01-01 20:17:28,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:28,374 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 43 [2019-01-01 20:17:28,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-01 20:17:28,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:28,386 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-01 20:17:28,386 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:28,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:28,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:28,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:28,420 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:59 [2019-01-01 20:17:29,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:29,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:29,311 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-01 20:17:29,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:53 [2019-01-01 20:17:30,544 WARN L181 SmtUtils]: Spent 698.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-01 20:17:30,548 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-01 20:17:30,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:17:30,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 20:17:30,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-01 20:17:30,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:30,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:30,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 20:17:30,627 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2019-01-01 20:17:32,414 WARN L181 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 45 [2019-01-01 20:17:34,125 WARN L181 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 45 [2019-01-01 20:17:34,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:34,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:34,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 40 [2019-01-01 20:17:34,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:34,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:34,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:34,186 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-01 20:17:34,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,239 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 34 treesize of output 39 [2019-01-01 20:17:34,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-01 20:17:34,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:34,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 22 treesize of output 14 [2019-01-01 20:17:34,249 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,284 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,291 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:34,337 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 62 treesize of output 77 [2019-01-01 20:17:34,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-01 20:17:34,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:17:34,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2019-01-01 20:17:34,349 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,355 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,374 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,408 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:115, output treesize:126 [2019-01-01 20:17:34,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:17:34,966 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-01 20:17:34,967 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:62 [2019-01-01 20:17:37,002 WARN L181 SmtUtils]: Spent 850.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-01 20:17:37,006 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-01 20:17:37,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:17:37,040 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-01 20:17:37,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 20:17:37,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 20:17:37,070 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:69 [2019-01-01 20:18:05,092 WARN L181 SmtUtils]: Spent 3.03 s on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 20:18:10,189 WARN L181 SmtUtils]: Spent 2.79 s on a formula simplification that was a NOOP. DAG size: 46 [2019-01-01 20:18:10,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2019-01-01 20:18:10,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2019-01-01 20:18:10,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2019-01-01 20:18:10,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-01 20:18:10,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,387 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-01 20:18:10,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,393 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,454 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 24 treesize of output 25 [2019-01-01 20:18:10,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-01 20:18:10,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-01 20:18:10,465 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,473 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,484 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 134 [2019-01-01 20:18:10,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-01 20:18:10,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:10,554 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 42 treesize of output 43 [2019-01-01 20:18:10,554 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,564 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,593 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:18:10,636 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 9 variables, input treesize:173, output treesize:167 [2019-01-01 20:18:11,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 20:18:11,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-01-01 20:18:11,767 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 20:18:11,767 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 15 treesize of output 11 [2019-01-01 20:18:11,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 20:18:11,778 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 21 treesize of output 11 [2019-01-01 20:18:11,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 20:18:11,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:18:11,811 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-01 20:18:11,811 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:188, output treesize:150 [2019-01-01 20:18:12,687 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-01 20:18:12,694 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 11 treesize of output 8 [2019-01-01 20:18:12,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 20:18:12,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 20:18:12,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 20:18:12,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:174, output treesize:304 [2019-01-01 20:18:13,712 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 20:18:13,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 20:18:13,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 20:18:13,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:174, output treesize:1 [2019-01-01 20:18:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 20:18:13,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 20:18:13,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 41] total 75 [2019-01-01 20:18:13,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-01 20:18:13,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-01 20:18:13,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=5323, Unknown=23, NotChecked=0, Total=5550 [2019-01-01 20:18:13,810 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 75 states. [2019-01-01 20:18:29,321 WARN L181 SmtUtils]: Spent 5.56 s on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-01-01 20:18:36,609 WARN L181 SmtUtils]: Spent 6.75 s on a formula simplification. DAG size of input: 197 DAG size of output: 60 [2019-01-01 20:18:44,429 WARN L181 SmtUtils]: Spent 7.14 s on a formula simplification. DAG size of input: 136 DAG size of output: 53 [2019-01-01 20:18:48,304 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2019-01-01 20:18:52,601 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-01-01 20:18:53,267 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-01-01 20:18:57,232 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-01-01 20:18:57,902 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-01-01 20:18:58,418 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 117 [2019-01-01 20:18:59,111 WARN L181 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 120 [2019-01-01 20:18:59,904 WARN L181 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 146 [2019-01-01 20:19:00,364 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 128 [2019-01-01 20:19:00,991 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 126 [2019-01-01 20:19:01,777 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 147 [2019-01-01 20:19:03,163 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 120 [2019-01-01 20:19:03,748 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 121 [2019-01-01 20:19:04,678 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 136 [2019-01-01 20:19:05,077 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 106 [2019-01-01 20:19:05,711 WARN L181 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 117 [2019-01-01 20:19:06,364 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 120 [2019-01-01 20:19:06,870 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 112 [2019-01-01 20:19:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 20:19:07,045 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-01-01 20:19:07,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 20:19:07,047 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 78 [2019-01-01 20:19:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 20:19:07,048 INFO L225 Difference]: With dead ends: 81 [2019-01-01 20:19:07,048 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 20:19:07,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 93.0s TimeCoverageRelationStatistics Valid=628, Invalid=10460, Unknown=42, NotChecked=0, Total=11130 [2019-01-01 20:19:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 20:19:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 20:19:07,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 20:19:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 20:19:07,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-01-01 20:19:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 20:19:07,050 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 20:19:07,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-01 20:19:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 20:19:07,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 20:19:07,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 08:19:07 BoogieIcfgContainer [2019-01-01 20:19:07,058 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 20:19:07,058 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 20:19:07,058 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 20:19:07,058 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 20:19:07,059 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 08:11:15" (3/4) ... [2019-01-01 20:19:07,063 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 20:19:07,071 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 20:19:07,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure insert_list [2019-01-01 20:19:07,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 20:19:07,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-01-01 20:19:07,072 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure search_list [2019-01-01 20:19:07,079 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-01 20:19:07,079 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-01 20:19:07,079 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 20:19:07,131 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 20:19:07,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 20:19:07,133 INFO L168 Benchmark]: Toolchain (without parser) took 473582.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 951.4 MB in the beginning and 942.9 MB in the end (delta: 8.4 MB). Peak memory consumption was 148.4 MB. Max. memory is 11.5 GB. [2019-01-01 20:19:07,135 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 20:19:07,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. [2019-01-01 20:19:07,136 INFO L168 Benchmark]: Boogie Preprocessor took 77.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 20:19:07,136 INFO L168 Benchmark]: RCFGBuilder took 862.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. [2019-01-01 20:19:07,140 INFO L168 Benchmark]: TraceAbstraction took 471869.31 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 27.8 MB). Free memory was 1.1 GB in the beginning and 950.4 MB in the end (delta: 102.5 MB). Peak memory consumption was 130.3 MB. Max. memory is 11.5 GB. [2019-01-01 20:19:07,140 INFO L168 Benchmark]: Witness Printer took 73.79 ms. Allocated memory is still 1.2 GB. Free memory was 950.4 MB in the beginning and 942.9 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-01-01 20:19:07,144 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 695.11 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 48.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 862.15 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 471869.31 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 27.8 MB). Free memory was 1.1 GB in the beginning and 950.4 MB in the end (delta: 102.5 MB). Peak memory consumption was 130.3 MB. Max. memory is 11.5 GB. * Witness Printer took 73.79 ms. Allocated memory is still 1.2 GB. Free memory was 950.4 MB in the beginning and 942.9 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 654]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 654]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 74 locations, 20 error locations. SAFE Result, 471.8s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 322.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1047 SDtfs, 5283 SDslu, 5264 SDs, 0 SdLazy, 18900 SolverSat, 1757 SolverUnsat, 56 SolverUnknown, 0 SolverNotchecked, 68.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1411 GetRequests, 555 SyntacticMatches, 75 SemanticMatches, 781 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14827 ImplicationChecksByTransitivity, 387.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=19, 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, 21 MinimizatonAttempts, 349 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 146.1s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1890 ConstructedInterpolants, 122 QuantifiedInterpolants, 3865269 SizeOfPredicates, 237 NumberOfNonLiveVariables, 4345 ConjunctsInSsa, 943 ConjunctsInUnsatCore, 32 InterpolantComputations, 10 PerfectInterpolantSequences, 964/1650 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...