./Ultimate.py --spec ../../sv-benchmarks/c/MemSafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/split_list_test05_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7bf1aafbc1548e76c7d5b18b2b6c35fe6068ce88 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/split_list_test05_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7bf1aafbc1548e76c7d5b18b2b6c35fe6068ce88 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_50 term size 55 --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:46:52,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:46:52,216 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:46:52,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:46:52,225 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:46:52,226 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:46:52,227 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:46:52,228 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:46:52,229 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:46:52,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:46:52,230 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:46:52,230 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:46:52,231 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:46:52,232 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:46:52,233 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:46:52,233 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:46:52,234 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:46:52,235 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:46:52,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:46:52,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:46:52,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:46:52,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:46:52,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:46:52,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:46:52,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:46:52,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:46:52,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:46:52,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:46:52,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:46:52,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:46:52,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:46:52,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:46:52,247 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:46:52,247 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:46:52,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:46:52,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:46:52,248 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-18 12:46:52,257 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:46:52,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:46:52,258 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:46:52,258 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:46:52,258 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:46:52,258 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:46:52,258 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:46:52,259 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 12:46:52,259 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:46:52,259 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:46:52,259 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 12:46:52,259 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 12:46:52,259 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:46:52,260 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:46:52,260 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:46:52,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:46:52,260 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:46:52,260 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:46:52,261 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:46:52,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:46:52,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:46:52,261 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 12:46:52,261 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 12:46:52,261 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 12:46:52,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:46:52,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:46:52,262 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:46:52,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:46:52,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:46:52,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:46:52,262 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:46:52,262 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:46:52,262 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:46:52,263 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:46:52,263 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 12:46:52,263 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:46:52,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 12:46:52,263 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 7bf1aafbc1548e76c7d5b18b2b6c35fe6068ce88 [2018-11-18 12:46:52,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:46:52,300 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:46:52,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:46:52,304 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:46:52,305 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:46:52,305 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext2/split_list_test05_true-valid-memsafety.i [2018-11-18 12:46:52,358 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/data/e9a16438f/483fa37d9cdb4caf8b6994355843283c/FLAG5071317dd [2018-11-18 12:46:52,748 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:46:52,750 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/sv-benchmarks/c/memsafety-ext2/split_list_test05_true-valid-memsafety.i [2018-11-18 12:46:52,760 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/data/e9a16438f/483fa37d9cdb4caf8b6994355843283c/FLAG5071317dd [2018-11-18 12:46:52,770 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/data/e9a16438f/483fa37d9cdb4caf8b6994355843283c [2018-11-18 12:46:52,773 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:46:52,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:46:52,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:46:52,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:46:52,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:46:52,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:46:52" (1/1) ... [2018-11-18 12:46:52,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f6f8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:52, skipping insertion in model container [2018-11-18 12:46:52,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:46:52" (1/1) ... [2018-11-18 12:46:52,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:46:52,829 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:46:53,104 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:46:53,111 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:46:53,155 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:46:53,254 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:46:53,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53 WrapperNode [2018-11-18 12:46:53,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:46:53,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:46:53,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:46:53,256 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:46:53,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (1/1) ... [2018-11-18 12:46:53,281 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (1/1) ... [2018-11-18 12:46:53,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:46:53,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:46:53,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:46:53,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:46:53,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (1/1) ... [2018-11-18 12:46:53,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (1/1) ... [2018-11-18 12:46:53,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (1/1) ... [2018-11-18 12:46:53,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (1/1) ... [2018-11-18 12:46:53,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (1/1) ... [2018-11-18 12:46:53,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (1/1) ... [2018-11-18 12:46:53,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (1/1) ... [2018-11-18 12:46:53,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:46:53,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:46:53,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:46:53,332 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:46:53,333 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:46:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:46:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:46:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure containsBody [2018-11-18 12:46:53,378 INFO L138 BoogieDeclarations]: Found implementation of procedure containsBody [2018-11-18 12:46:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:46:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:46:53,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:46:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:46:53,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:46:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:46:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:46:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:46:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure containsHead [2018-11-18 12:46:53,379 INFO L138 BoogieDeclarations]: Found implementation of procedure containsHead [2018-11-18 12:46:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:46:53,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:46:53,380 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-18 12:46:53,380 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-18 12:46:54,414 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:46:54,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:46:54 BoogieIcfgContainer [2018-11-18 12:46:54,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:46:54,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:46:54,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:46:54,419 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:46:54,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:46:52" (1/3) ... [2018-11-18 12:46:54,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca784f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:46:54, skipping insertion in model container [2018-11-18 12:46:54,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:46:53" (2/3) ... [2018-11-18 12:46:54,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca784f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:46:54, skipping insertion in model container [2018-11-18 12:46:54,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:46:54" (3/3) ... [2018-11-18 12:46:54,422 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05_true-valid-memsafety.i [2018-11-18 12:46:54,428 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:46:54,434 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 141 error locations. [2018-11-18 12:46:54,444 INFO L257 AbstractCegarLoop]: Starting to check reachability of 141 error locations. [2018-11-18 12:46:54,466 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:46:54,466 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 12:46:54,466 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:46:54,466 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:46:54,467 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:46:54,471 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:46:54,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:46:54,471 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:46:54,494 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states. [2018-11-18 12:46:54,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 12:46:54,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:46:54,501 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:46:54,504 INFO L423 AbstractCegarLoop]: === Iteration 1 === [containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr19REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-18 12:46:54,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:46:54,509 INFO L82 PathProgramCache]: Analyzing trace with hash -278075336, now seen corresponding path program 1 times [2018-11-18 12:46:54,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:46:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:54,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:46:54,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:54,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:46:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:46:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:46:54,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:46:54,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:46:54,630 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:46:54,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:46:54,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:46:54,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:46:54,645 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 3 states. [2018-11-18 12:46:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:46:54,975 INFO L93 Difference]: Finished difference Result 391 states and 436 transitions. [2018-11-18 12:46:54,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:46:54,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 12:46:54,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:46:54,987 INFO L225 Difference]: With dead ends: 391 [2018-11-18 12:46:54,987 INFO L226 Difference]: Without dead ends: 388 [2018-11-18 12:46:54,989 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:46:55,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-11-18 12:46:55,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 343. [2018-11-18 12:46:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-11-18 12:46:55,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 387 transitions. [2018-11-18 12:46:55,037 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 387 transitions. Word has length 7 [2018-11-18 12:46:55,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:46:55,038 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 387 transitions. [2018-11-18 12:46:55,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:46:55,038 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 387 transitions. [2018-11-18 12:46:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 12:46:55,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:46:55,038 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:46:55,039 INFO L423 AbstractCegarLoop]: === Iteration 2 === [containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr19REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-18 12:46:55,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:46:55,040 INFO L82 PathProgramCache]: Analyzing trace with hash -278075335, now seen corresponding path program 1 times [2018-11-18 12:46:55,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:46:55,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:55,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:46:55,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:55,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:46:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:46:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:46:55,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:46:55,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:46:55,081 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:46:55,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:46:55,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:46:55,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:46:55,083 INFO L87 Difference]: Start difference. First operand 343 states and 387 transitions. Second operand 3 states. [2018-11-18 12:46:55,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:46:55,257 INFO L93 Difference]: Finished difference Result 345 states and 391 transitions. [2018-11-18 12:46:55,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:46:55,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 12:46:55,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:46:55,259 INFO L225 Difference]: With dead ends: 345 [2018-11-18 12:46:55,259 INFO L226 Difference]: Without dead ends: 345 [2018-11-18 12:46:55,260 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:46:55,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-18 12:46:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 341. [2018-11-18 12:46:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-11-18 12:46:55,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 385 transitions. [2018-11-18 12:46:55,276 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 385 transitions. Word has length 7 [2018-11-18 12:46:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:46:55,276 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 385 transitions. [2018-11-18 12:46:55,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:46:55,277 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 385 transitions. [2018-11-18 12:46:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:46:55,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:46:55,277 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:46:55,278 INFO L423 AbstractCegarLoop]: === Iteration 3 === [containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr19REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-18 12:46:55,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:46:55,278 INFO L82 PathProgramCache]: Analyzing trace with hash 735672365, now seen corresponding path program 1 times [2018-11-18 12:46:55,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:46:55,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:55,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:46:55,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:55,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:46:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:46:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:46:55,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:46:55,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:46:55,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:46:55,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:46:55,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:46:55,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:46:55,319 INFO L87 Difference]: Start difference. First operand 341 states and 385 transitions. Second operand 3 states. [2018-11-18 12:46:55,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:46:55,502 INFO L93 Difference]: Finished difference Result 336 states and 380 transitions. [2018-11-18 12:46:55,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:46:55,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 12:46:55,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:46:55,504 INFO L225 Difference]: With dead ends: 336 [2018-11-18 12:46:55,504 INFO L226 Difference]: Without dead ends: 336 [2018-11-18 12:46:55,504 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:46:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-11-18 12:46:55,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2018-11-18 12:46:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-18 12:46:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 380 transitions. [2018-11-18 12:46:55,517 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 380 transitions. Word has length 15 [2018-11-18 12:46:55,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:46:55,517 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 380 transitions. [2018-11-18 12:46:55,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:46:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 380 transitions. [2018-11-18 12:46:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:46:55,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:46:55,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:46:55,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr19REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-18 12:46:55,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:46:55,519 INFO L82 PathProgramCache]: Analyzing trace with hash 735672366, now seen corresponding path program 1 times [2018-11-18 12:46:55,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:46:55,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:55,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:46:55,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:55,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:46:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:46:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:46:55,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:46:55,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:46:55,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:46:55,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:46:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:46:55,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:46:55,560 INFO L87 Difference]: Start difference. First operand 336 states and 380 transitions. Second operand 3 states. [2018-11-18 12:46:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:46:55,754 INFO L93 Difference]: Finished difference Result 331 states and 375 transitions. [2018-11-18 12:46:55,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:46:55,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 12:46:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:46:55,756 INFO L225 Difference]: With dead ends: 331 [2018-11-18 12:46:55,756 INFO L226 Difference]: Without dead ends: 331 [2018-11-18 12:46:55,757 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:46:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-18 12:46:55,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-11-18 12:46:55,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-18 12:46:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 375 transitions. [2018-11-18 12:46:55,766 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 375 transitions. Word has length 15 [2018-11-18 12:46:55,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:46:55,766 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 375 transitions. [2018-11-18 12:46:55,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:46:55,766 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 375 transitions. [2018-11-18 12:46:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 12:46:55,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:46:55,767 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:46:55,767 INFO L423 AbstractCegarLoop]: === Iteration 5 === [containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr19REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-18 12:46:55,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:46:55,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1331007255, now seen corresponding path program 1 times [2018-11-18 12:46:55,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:46:55,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:55,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:46:55,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:55,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:46:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:46:55,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:46:55,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:46:55,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:46:55,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:46:55,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:46:55,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:46:55,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:46:55,834 INFO L87 Difference]: Start difference. First operand 331 states and 375 transitions. Second operand 6 states. [2018-11-18 12:46:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:46:56,191 INFO L93 Difference]: Finished difference Result 364 states and 407 transitions. [2018-11-18 12:46:56,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:46:56,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 12:46:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:46:56,193 INFO L225 Difference]: With dead ends: 364 [2018-11-18 12:46:56,193 INFO L226 Difference]: Without dead ends: 364 [2018-11-18 12:46:56,193 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:46:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-11-18 12:46:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 323. [2018-11-18 12:46:56,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-18 12:46:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 367 transitions. [2018-11-18 12:46:56,201 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 367 transitions. Word has length 16 [2018-11-18 12:46:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:46:56,202 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 367 transitions. [2018-11-18 12:46:56,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:46:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 367 transitions. [2018-11-18 12:46:56,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 12:46:56,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:46:56,202 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:46:56,203 INFO L423 AbstractCegarLoop]: === Iteration 6 === [containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr19REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-18 12:46:56,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:46:56,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1331007256, now seen corresponding path program 1 times [2018-11-18 12:46:56,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:46:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:56,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:46:56,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:56,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:46:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:46:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:46:56,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:46:56,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:46:56,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:46:56,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 12:46:56,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 12:46:56,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:46:56,276 INFO L87 Difference]: Start difference. First operand 323 states and 367 transitions. Second operand 6 states. [2018-11-18 12:46:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:46:56,636 INFO L93 Difference]: Finished difference Result 354 states and 397 transitions. [2018-11-18 12:46:56,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:46:56,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-18 12:46:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:46:56,638 INFO L225 Difference]: With dead ends: 354 [2018-11-18 12:46:56,639 INFO L226 Difference]: Without dead ends: 354 [2018-11-18 12:46:56,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:46:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-18 12:46:56,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 314. [2018-11-18 12:46:56,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-18 12:46:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 357 transitions. [2018-11-18 12:46:56,648 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 357 transitions. Word has length 16 [2018-11-18 12:46:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:46:56,648 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 357 transitions. [2018-11-18 12:46:56,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 12:46:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 357 transitions. [2018-11-18 12:46:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 12:46:56,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:46:56,649 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:46:56,649 INFO L423 AbstractCegarLoop]: === Iteration 7 === [containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr19REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-18 12:46:56,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:46:56,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1134305224, now seen corresponding path program 1 times [2018-11-18 12:46:56,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:46:56,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:56,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:46:56,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:56,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:46:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:46:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:46:56,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:46:56,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 12:46:56,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:46:56,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 12:46:56,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 12:46:56,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 12:46:56,755 INFO L87 Difference]: Start difference. First operand 314 states and 357 transitions. Second operand 7 states. [2018-11-18 12:46:56,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:46:56,924 INFO L93 Difference]: Finished difference Result 329 states and 375 transitions. [2018-11-18 12:46:56,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:46:56,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-18 12:46:56,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:46:56,926 INFO L225 Difference]: With dead ends: 329 [2018-11-18 12:46:56,926 INFO L226 Difference]: Without dead ends: 329 [2018-11-18 12:46:56,926 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-18 12:46:56,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-18 12:46:56,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 323. [2018-11-18 12:46:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-18 12:46:56,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 368 transitions. [2018-11-18 12:46:56,947 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 368 transitions. Word has length 25 [2018-11-18 12:46:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:46:56,947 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 368 transitions. [2018-11-18 12:46:56,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 12:46:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 368 transitions. [2018-11-18 12:46:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 12:46:56,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:46:56,948 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:46:56,948 INFO L423 AbstractCegarLoop]: === Iteration 8 === [containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr19REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-18 12:46:56,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:46:56,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1506905675, now seen corresponding path program 1 times [2018-11-18 12:46:56,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:46:56,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:56,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:46:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:56,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:46:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:46:57,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:46:57,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:46:57,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 12:46:57,097 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 12:46:57,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:46:57,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:46:57,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:46:57,097 INFO L87 Difference]: Start difference. First operand 323 states and 368 transitions. Second operand 8 states. [2018-11-18 12:46:57,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:46:57,296 INFO L93 Difference]: Finished difference Result 328 states and 373 transitions. [2018-11-18 12:46:57,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:46:57,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-18 12:46:57,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:46:57,297 INFO L225 Difference]: With dead ends: 328 [2018-11-18 12:46:57,298 INFO L226 Difference]: Without dead ends: 328 [2018-11-18 12:46:57,298 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:46:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-18 12:46:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2018-11-18 12:46:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-18 12:46:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 371 transitions. [2018-11-18 12:46:57,304 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 371 transitions. Word has length 27 [2018-11-18 12:46:57,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:46:57,304 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 371 transitions. [2018-11-18 12:46:57,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:46:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 371 transitions. [2018-11-18 12:46:57,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 12:46:57,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:46:57,305 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:46:57,305 INFO L423 AbstractCegarLoop]: === Iteration 9 === [containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr19REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr16REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION]=== [2018-11-18 12:46:57,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:46:57,306 INFO L82 PathProgramCache]: Analyzing trace with hash 486284083, now seen corresponding path program 1 times [2018-11-18 12:46:57,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 12:46:57,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:57,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:46:57,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:46:57,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 12:46:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:46:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:46:57,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:46:57,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 12:46:57,710 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-18 12:46:57,711 INFO L202 CegarAbsIntRunner]: [0], [1], [217], [218], [221], [224], [228], [232], [236], [244], [247], [446], [447], [450], [453], [456], [457], [460], [462], [466], [467], [470], [473], [476], [479], [480], [483], [486], [487], [490], [494], [500], [501], [502], [503], [505], [506], [507] [2018-11-18 12:46:57,743 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 12:46:57,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 12:46:57,940 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-18 12:46:57,941 INFO L272 AbstractInterpreter]: Visited 38 different actions 63 times. Merged at 1 different actions 2 times. Never widened. Performed 462 root evaluator evaluations with a maximum evaluation depth of 3. Performed 462 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 1 different actions. Largest state had 33 variables. [2018-11-18 12:46:57,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:46:57,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-18 12:46:57,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:46:57,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:46:57,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:46:57,962 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-18 12:46:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:46:58,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:46:58,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 12:46:58,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:46:58,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-18 12:46:58,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 12:46:58,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-18 12:46:58,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-18 12:46:58,253 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 12:46:58,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:46:58,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:46:58,294 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-11-18 12:46:58,352 INFO L477 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 33 treesize of output 28 [2018-11-18 12:46:58,355 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:46:58,357 INFO L477 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 [2018-11-18 12:46:58,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2018-11-18 12:46:58,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:46:58,419 INFO L477 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 3 case distinctions, treesize of input 48 treesize of output 54 [2018-11-18 12:46:58,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 12:46:58,460 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:46:58,461 INFO L477 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 51 treesize of output 66 [2018-11-18 12:46:58,462 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:46:58,505 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 3 xjuncts. [2018-11-18 12:46:58,505 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-11-18 12:46:58,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:46:58,572 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:46:58,572 INFO L477 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 66 treesize of output 60 [2018-11-18 12:46:58,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:46:58,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:139, output treesize:60 [2018-11-18 12:46:58,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:46:58,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:46:58,673 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:46:58,674 INFO L477 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 28 treesize of output 52 [2018-11-18 12:46:58,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:46:58,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:82 [2018-11-18 12:46:58,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-11-18 12:46:58,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:46:58,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:46:58,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-11-18 12:46:58,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-11-18 12:46:58,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:46:58,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-18 12:46:58,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-11-18 12:46:58,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-11-18 12:46:58,940 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:46:58,941 INFO L477 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 [2018-11-18 12:46:58,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:46:58,950 INFO L477 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 15 treesize of output 8 [2018-11-18 12:46:58,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 12:46:58,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:46:58,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:46:58,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-11-18 12:46:59,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:46:59,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:47:01,458 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:01,458 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:01,461 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:01,462 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 292 [2018-11-18 12:47:01,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:01,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 283 treesize of output 174 [2018-11-18 12:47:01,553 INFO L477 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 11 treesize of output 10 [2018-11-18 12:47:01,553 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:01,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 122 [2018-11-18 12:47:01,701 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 65 [2018-11-18 12:47:01,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 62 [2018-11-18 12:47:01,717 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:01,718 INFO L477 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 53 treesize of output 61 [2018-11-18 12:47:01,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:01,750 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:01,761 INFO L477 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 3 case distinctions, treesize of input 50 treesize of output 69 [2018-11-18 12:47:01,761 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:01,792 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:47:01,844 INFO L477 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 57 treesize of output 60 [2018-11-18 12:47:01,846 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:01,846 INFO L477 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 20 treesize of output 28 [2018-11-18 12:47:01,847 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:01,855 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:01,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-11-18 12:47:01,903 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:01,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 69 [2018-11-18 12:47:01,920 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-11-18 12:47:01,944 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:47:01,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-11-18 12:47:01,949 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:01,957 INFO L477 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 2 case distinctions, treesize of input 31 treesize of output 38 [2018-11-18 12:47:01,957 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:01,967 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:01,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2018-11-18 12:47:01,971 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:01,972 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:01,976 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 33 [2018-11-18 12:47:01,976 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:01,987 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:02,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 54 [2018-11-18 12:47:02,046 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:02,064 INFO L477 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 72 [2018-11-18 12:47:02,065 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-11-18 12:47:02,100 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:02,100 INFO L477 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 49 treesize of output 40 [2018-11-18 12:47:02,101 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:02,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-11-18 12:47:02,130 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:02,152 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 12:47:02,215 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 12:47:02,235 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-18 12:47:02,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-18 12:47:02,264 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:130, output treesize:59 [2018-11-18 12:47:03,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-18 12:47:09,767 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 91 [2018-11-18 12:47:09,791 INFO L477 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 11 treesize of output 10 [2018-11-18 12:47:09,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:09,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 76 [2018-11-18 12:47:09,886 INFO L477 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 50 treesize of output 53 [2018-11-18 12:47:09,889 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:09,889 INFO L477 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 20 treesize of output 28 [2018-11-18 12:47:09,889 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:09,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:09,901 INFO L477 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 71 treesize of output 74 [2018-11-18 12:47:09,903 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:09,904 INFO L477 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 20 treesize of output 28 [2018-11-18 12:47:09,904 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:09,915 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:09,917 INFO L477 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 61 treesize of output 64 [2018-11-18 12:47:09,920 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:09,921 INFO L477 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 20 treesize of output 28 [2018-11-18 12:47:09,921 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:09,935 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:10,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 61 [2018-11-18 12:47:10,059 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,060 INFO L477 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 52 treesize of output 60 [2018-11-18 12:47:10,061 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:10,110 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,122 INFO L477 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 3 case distinctions, treesize of input 52 treesize of output 71 [2018-11-18 12:47:10,122 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:10,179 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:47:10,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 72 [2018-11-18 12:47:10,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,216 INFO L477 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 3 case distinctions, treesize of input 63 treesize of output 82 [2018-11-18 12:47:10,216 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:10,284 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,285 INFO L477 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 63 treesize of output 71 [2018-11-18 12:47:10,285 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:10,324 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:47:10,483 INFO L477 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 64 treesize of output 58 [2018-11-18 12:47:10,486 INFO L477 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 22 treesize of output 26 [2018-11-18 12:47:10,498 INFO L477 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 6 [2018-11-18 12:47:10,498 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:10,504 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 12:47:10,505 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:10,516 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-18 12:47:10,543 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,544 INFO L477 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 17 treesize of output 7 [2018-11-18 12:47:10,544 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:10,566 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-18 12:47:10,569 INFO L477 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 66 treesize of output 58 [2018-11-18 12:47:10,571 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2018-11-18 12:47:10,581 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:10,600 INFO L477 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 22 treesize of output 26 [2018-11-18 12:47:10,616 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 12:47:10,617 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:10,619 INFO L477 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 6 [2018-11-18 12:47:10,620 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:10,636 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-18 12:47:10,673 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-18 12:47:10,676 INFO L477 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 64 treesize of output 58 [2018-11-18 12:47:10,679 INFO L477 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 22 treesize of output 26 [2018-11-18 12:47:10,691 INFO L477 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 6 [2018-11-18 12:47:10,691 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:10,697 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 12:47:10,698 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:10,717 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-18 12:47:10,747 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,747 INFO L477 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 17 treesize of output 7 [2018-11-18 12:47:10,748 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:10,770 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-18 12:47:10,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-11-18 12:47:10,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-11-18 12:47:10,781 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:10,806 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 58 [2018-11-18 12:47:10,815 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:10,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,844 INFO L477 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 46 treesize of output 37 [2018-11-18 12:47:10,844 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:10,869 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:47:10,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 55 [2018-11-18 12:47:10,878 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 86 [2018-11-18 12:47:10,902 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-18 12:47:10,977 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:10,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 57 [2018-11-18 12:47:10,987 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:11,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-11-18 12:47:11,064 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:11,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-18 12:47:11,067 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:11,149 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-18 12:47:11,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2018-11-18 12:47:11,158 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:11,159 INFO L477 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 50 treesize of output 41 [2018-11-18 12:47:11,159 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:11,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-11-18 12:47:11,186 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:11,212 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:11,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 58 [2018-11-18 12:47:11,223 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:11,250 INFO L267 ElimStorePlain]: Start of recursive call 41: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:47:11,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 62 [2018-11-18 12:47:11,594 INFO L477 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 52 treesize of output 44 [2018-11-18 12:47:11,594 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:11,636 INFO L477 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 49 treesize of output 41 [2018-11-18 12:47:11,636 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:11,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2018-11-18 12:47:11,676 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:11,725 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 49 [2018-11-18 12:47:11,726 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:11,788 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:11,788 INFO L477 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 34 treesize of output 25 [2018-11-18 12:47:11,788 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:11,791 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:11,791 INFO L477 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 44 treesize of output 35 [2018-11-18 12:47:11,792 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:11,838 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:11,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 52 [2018-11-18 12:47:11,848 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:11,901 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:11,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 85 [2018-11-18 12:47:11,922 INFO L267 ElimStorePlain]: Start of recursive call 53: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-18 12:47:12,015 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:12,016 INFO L477 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 40 treesize of output 31 [2018-11-18 12:47:12,016 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:12,110 INFO L267 ElimStorePlain]: Start of recursive call 45: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-11-18 12:47:12,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 65 [2018-11-18 12:47:12,121 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:12,122 INFO L477 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 57 treesize of output 48 [2018-11-18 12:47:12,122 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:12,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 53 [2018-11-18 12:47:12,183 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2018-11-18 12:47:12,183 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:12,193 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-11-18 12:47:12,194 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:12,196 INFO L477 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 39 treesize of output 31 [2018-11-18 12:47:12,196 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:12,262 INFO L477 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 41 treesize of output 37 [2018-11-18 12:47:12,263 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:12,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 60 [2018-11-18 12:47:12,279 INFO L267 ElimStorePlain]: Start of recursive call 62: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-18 12:47:12,364 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-18 12:47:12,450 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:12,450 INFO L477 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 60 treesize of output 51 [2018-11-18 12:47:12,451 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:12,541 INFO L477 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 44 treesize of output 47 [2018-11-18 12:47:12,560 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 12:47:12,560 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:12,562 INFO L477 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 6 [2018-11-18 12:47:12,562 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:12,578 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-18 12:47:12,682 INFO L477 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 45 treesize of output 37 [2018-11-18 12:47:12,683 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:12,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-11-18 12:47:12,685 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:12,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-18 12:47:12,687 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:12,782 INFO L267 ElimStorePlain]: Start of recursive call 55: 5 dim-1 vars, End of recursive call: 6 dim-0 vars, and 11 xjuncts. [2018-11-18 12:47:13,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 68 [2018-11-18 12:47:13,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 53 [2018-11-18 12:47:13,365 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2018-11-18 12:47:13,366 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:13,368 INFO L477 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 39 treesize of output 31 [2018-11-18 12:47:13,368 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:13,374 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 45 [2018-11-18 12:47:13,375 INFO L267 ElimStorePlain]: Start of recursive call 74: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:47:13,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 60 [2018-11-18 12:47:13,451 INFO L267 ElimStorePlain]: Start of recursive call 75: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-18 12:47:13,458 INFO L477 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 41 treesize of output 37 [2018-11-18 12:47:13,459 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:13,547 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-18 12:47:13,886 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:47:13,887 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_38 term size 52 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 12:47:13,890 INFO L168 Benchmark]: Toolchain (without parser) took 21116.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 267.4 MB). Free memory was 958.1 MB in the beginning and 954.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 343.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:47:13,890 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:47:13,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:47:13,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:47:13,891 INFO L168 Benchmark]: Boogie Preprocessor took 45.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:47:13,891 INFO L168 Benchmark]: RCFGBuilder took 1083.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:47:13,891 INFO L168 Benchmark]: TraceAbstraction took 19473.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.1 MB). Free memory was 1.0 GB in the beginning and 954.5 MB in the end (delta: 70.3 MB). Peak memory consumption was 285.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:47:13,893 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 479.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -153.7 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1083.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.2 MB). Peak memory consumption was 84.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19473.63 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 143.1 MB). Free memory was 1.0 GB in the beginning and 954.5 MB in the end (delta: 70.3 MB). Peak memory consumption was 285.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_38 term size 52 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_38 term size 52: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 12:47:15,427 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:47:15,428 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:47:15,437 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:47:15,437 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:47:15,438 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:47:15,439 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:47:15,440 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:47:15,441 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:47:15,442 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:47:15,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:47:15,443 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:47:15,444 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:47:15,445 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:47:15,446 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:47:15,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:47:15,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:47:15,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:47:15,449 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:47:15,450 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:47:15,451 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:47:15,452 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:47:15,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:47:15,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:47:15,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:47:15,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:47:15,456 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:47:15,457 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:47:15,457 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:47:15,458 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:47:15,458 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:47:15,459 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:47:15,459 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:47:15,459 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:47:15,460 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:47:15,461 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:47:15,461 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2018-11-18 12:47:15,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:47:15,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:47:15,474 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 12:47:15,474 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 12:47:15,474 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 12:47:15,474 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 12:47:15,474 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 12:47:15,475 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 12:47:15,475 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 12:47:15,475 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 12:47:15,475 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:47:15,476 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:47:15,476 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:47:15,476 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 12:47:15,476 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:47:15,476 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:47:15,476 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 12:47:15,476 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:47:15,477 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-18 12:47:15,477 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-18 12:47:15,477 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-18 12:47:15,477 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 12:47:15,477 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 12:47:15,477 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 12:47:15,477 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 12:47:15,477 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:47:15,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:47:15,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:47:15,478 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 12:47:15,478 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 12:47:15,481 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:47:15,481 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:47:15,481 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 12:47:15,481 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 12:47:15,481 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 12:47:15,482 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 12:47:15,482 INFO L133 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 7bf1aafbc1548e76c7d5b18b2b6c35fe6068ce88 [2018-11-18 12:47:15,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:47:15,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:47:15,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:47:15,531 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:47:15,531 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:47:15,532 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/../../sv-benchmarks/c/memsafety-ext2/split_list_test05_true-valid-memsafety.i [2018-11-18 12:47:15,573 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/data/1bcd57e96/565249808cf44b6cb34e1b1a18224b48/FLAGf84a426b1 [2018-11-18 12:47:15,945 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:47:15,945 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/sv-benchmarks/c/memsafety-ext2/split_list_test05_true-valid-memsafety.i [2018-11-18 12:47:15,953 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/data/1bcd57e96/565249808cf44b6cb34e1b1a18224b48/FLAGf84a426b1 [2018-11-18 12:47:15,962 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/data/1bcd57e96/565249808cf44b6cb34e1b1a18224b48 [2018-11-18 12:47:15,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:47:15,965 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:47:15,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:47:15,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:47:15,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:47:15,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:47:15" (1/1) ... [2018-11-18 12:47:15,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76351e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:15, skipping insertion in model container [2018-11-18 12:47:15,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:47:15" (1/1) ... [2018-11-18 12:47:15,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:47:16,011 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:47:16,268 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:47:16,279 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:47:16,329 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:47:16,432 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:47:16,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16 WrapperNode [2018-11-18 12:47:16,432 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:47:16,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:47:16,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:47:16,433 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:47:16,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (1/1) ... [2018-11-18 12:47:16,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (1/1) ... [2018-11-18 12:47:16,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:47:16,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:47:16,459 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:47:16,459 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:47:16,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (1/1) ... [2018-11-18 12:47:16,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (1/1) ... [2018-11-18 12:47:16,468 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (1/1) ... [2018-11-18 12:47:16,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (1/1) ... [2018-11-18 12:47:16,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (1/1) ... [2018-11-18 12:47:16,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (1/1) ... [2018-11-18 12:47:16,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (1/1) ... [2018-11-18 12:47:16,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:47:16,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:47:16,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:47:16,495 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:47:16,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 12:47:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-18 12:47:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:47:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure containsBody [2018-11-18 12:47:16,537 INFO L138 BoogieDeclarations]: Found implementation of procedure containsBody [2018-11-18 12:47:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 12:47:16,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 12:47:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 12:47:16,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 12:47:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 12:47:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 12:47:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-18 12:47:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:47:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure containsHead [2018-11-18 12:47:16,538 INFO L138 BoogieDeclarations]: Found implementation of procedure containsHead [2018-11-18 12:47:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:47:16,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:47:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure append [2018-11-18 12:47:16,539 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2018-11-18 12:47:17,506 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:47:17,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:47:17 BoogieIcfgContainer [2018-11-18 12:47:17,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:47:17,508 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 12:47:17,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 12:47:17,511 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 12:47:17,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 12:47:15" (1/3) ... [2018-11-18 12:47:17,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688dec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:47:17, skipping insertion in model container [2018-11-18 12:47:17,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:47:16" (2/3) ... [2018-11-18 12:47:17,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688dec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 12:47:17, skipping insertion in model container [2018-11-18 12:47:17,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:47:17" (3/3) ... [2018-11-18 12:47:17,514 INFO L112 eAbstractionObserver]: Analyzing ICFG split_list_test05_true-valid-memsafety.i [2018-11-18 12:47:17,524 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 12:47:17,531 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 141 error locations. [2018-11-18 12:47:17,545 INFO L257 AbstractCegarLoop]: Starting to check reachability of 141 error locations. [2018-11-18 12:47:17,569 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:47:17,569 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 12:47:17,569 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-18 12:47:17,569 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 12:47:17,570 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:47:17,570 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:47:17,570 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 12:47:17,570 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:47:17,570 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 12:47:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states. [2018-11-18 12:47:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 12:47:17,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:47:17,599 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:17,601 INFO L423 AbstractCegarLoop]: === Iteration 1 === [containsHeadErr19REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-18 12:47:17,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:17,606 INFO L82 PathProgramCache]: Analyzing trace with hash -420780205, now seen corresponding path program 1 times [2018-11-18 12:47:17,609 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:47:17,610 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:47:17,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:17,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:17,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:47:17,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:17,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:17,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 12:47:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:17,736 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:47:17,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:47:17,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:47:17,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:47:17,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:47:17,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:47:17,758 INFO L87 Difference]: Start difference. First operand 325 states. Second operand 3 states. [2018-11-18 12:47:18,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:47:18,193 INFO L93 Difference]: Finished difference Result 384 states and 429 transitions. [2018-11-18 12:47:18,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:47:18,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 12:47:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:47:18,207 INFO L225 Difference]: With dead ends: 384 [2018-11-18 12:47:18,208 INFO L226 Difference]: Without dead ends: 381 [2018-11-18 12:47:18,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:47:18,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-18 12:47:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 336. [2018-11-18 12:47:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-11-18 12:47:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 380 transitions. [2018-11-18 12:47:18,255 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 380 transitions. Word has length 7 [2018-11-18 12:47:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:47:18,255 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 380 transitions. [2018-11-18 12:47:18,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:47:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 380 transitions. [2018-11-18 12:47:18,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-18 12:47:18,256 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:47:18,256 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:18,256 INFO L423 AbstractCegarLoop]: === Iteration 2 === [containsHeadErr19REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-18 12:47:18,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:18,257 INFO L82 PathProgramCache]: Analyzing trace with hash -420780204, now seen corresponding path program 1 times [2018-11-18 12:47:18,257 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:47:18,257 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:47:18,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:18,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:18,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:47:18,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:18,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:18,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 12:47:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:18,326 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:47:18,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:47:18,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:47:18,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:47:18,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:47:18,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:47:18,329 INFO L87 Difference]: Start difference. First operand 336 states and 380 transitions. Second operand 3 states. [2018-11-18 12:47:18,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:47:18,774 INFO L93 Difference]: Finished difference Result 338 states and 384 transitions. [2018-11-18 12:47:18,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:47:18,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-18 12:47:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:47:18,776 INFO L225 Difference]: With dead ends: 338 [2018-11-18 12:47:18,776 INFO L226 Difference]: Without dead ends: 338 [2018-11-18 12:47:18,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:47:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-18 12:47:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 334. [2018-11-18 12:47:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-11-18 12:47:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 378 transitions. [2018-11-18 12:47:18,792 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 378 transitions. Word has length 7 [2018-11-18 12:47:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:47:18,792 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 378 transitions. [2018-11-18 12:47:18,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:47:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 378 transitions. [2018-11-18 12:47:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:47:18,793 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:47:18,793 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:18,794 INFO L423 AbstractCegarLoop]: === Iteration 3 === [containsHeadErr19REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-18 12:47:18,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:18,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1537251555, now seen corresponding path program 1 times [2018-11-18 12:47:18,794 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:47:18,795 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:47:18,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:18,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:18,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:47:18,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:18,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:18,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 12:47:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:18,854 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:47:18,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:47:18,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:47:18,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:47:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:47:18,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:47:18,856 INFO L87 Difference]: Start difference. First operand 334 states and 378 transitions. Second operand 3 states. [2018-11-18 12:47:19,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:47:19,206 INFO L93 Difference]: Finished difference Result 329 states and 373 transitions. [2018-11-18 12:47:19,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:47:19,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 12:47:19,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:47:19,208 INFO L225 Difference]: With dead ends: 329 [2018-11-18 12:47:19,208 INFO L226 Difference]: Without dead ends: 329 [2018-11-18 12:47:19,208 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:47:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-11-18 12:47:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-11-18 12:47:19,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-18 12:47:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 373 transitions. [2018-11-18 12:47:19,219 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 373 transitions. Word has length 15 [2018-11-18 12:47:19,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:47:19,220 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 373 transitions. [2018-11-18 12:47:19,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:47:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 373 transitions. [2018-11-18 12:47:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 12:47:19,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:47:19,221 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:19,221 INFO L423 AbstractCegarLoop]: === Iteration 4 === [containsHeadErr19REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-18 12:47:19,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:19,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1537251556, now seen corresponding path program 1 times [2018-11-18 12:47:19,222 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:47:19,222 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:47:19,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:19,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:19,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:47:19,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:19,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:19,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 12:47:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:19,302 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:47:19,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:47:19,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 12:47:19,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 12:47:19,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 12:47:19,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:47:19,307 INFO L87 Difference]: Start difference. First operand 329 states and 373 transitions. Second operand 3 states. [2018-11-18 12:47:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:47:19,789 INFO L93 Difference]: Finished difference Result 324 states and 368 transitions. [2018-11-18 12:47:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 12:47:19,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 12:47:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:47:19,791 INFO L225 Difference]: With dead ends: 324 [2018-11-18 12:47:19,791 INFO L226 Difference]: Without dead ends: 324 [2018-11-18 12:47:19,792 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 12:47:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-11-18 12:47:19,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-11-18 12:47:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-11-18 12:47:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 368 transitions. [2018-11-18 12:47:19,801 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 368 transitions. Word has length 15 [2018-11-18 12:47:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:47:19,801 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 368 transitions. [2018-11-18 12:47:19,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 12:47:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 368 transitions. [2018-11-18 12:47:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 12:47:19,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:47:19,803 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:19,803 INFO L423 AbstractCegarLoop]: === Iteration 5 === [containsHeadErr19REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-18 12:47:19,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:19,803 INFO L82 PathProgramCache]: Analyzing trace with hash 410158364, now seen corresponding path program 1 times [2018-11-18 12:47:19,804 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:47:19,804 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:47:19,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:19,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:19,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:47:19,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:19,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:19,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-18 12:47:19,891 INFO L477 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 14 treesize of output 11 [2018-11-18 12:47:19,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:19,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:19,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-11-18 12:47:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:19,911 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:47:19,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:47:19,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:47:19,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:47:19,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:47:19,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:47:19,913 INFO L87 Difference]: Start difference. First operand 324 states and 368 transitions. Second operand 5 states. [2018-11-18 12:47:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:47:20,566 INFO L93 Difference]: Finished difference Result 357 states and 400 transitions. [2018-11-18 12:47:20,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:47:20,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 12:47:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:47:20,568 INFO L225 Difference]: With dead ends: 357 [2018-11-18 12:47:20,568 INFO L226 Difference]: Without dead ends: 357 [2018-11-18 12:47:20,568 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:47:20,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-11-18 12:47:20,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 316. [2018-11-18 12:47:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-18 12:47:20,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 360 transitions. [2018-11-18 12:47:20,576 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 360 transitions. Word has length 16 [2018-11-18 12:47:20,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:47:20,576 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 360 transitions. [2018-11-18 12:47:20,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:47:20,576 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 360 transitions. [2018-11-18 12:47:20,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 12:47:20,577 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:47:20,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:20,577 INFO L423 AbstractCegarLoop]: === Iteration 6 === [containsHeadErr19REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-18 12:47:20,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:20,577 INFO L82 PathProgramCache]: Analyzing trace with hash 410158365, now seen corresponding path program 1 times [2018-11-18 12:47:20,578 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:47:20,578 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:47:20,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:20,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:20,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:47:20,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:20,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:47:20,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:20,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:20,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-11-18 12:47:20,693 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:20,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:20,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-18 12:47:20,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:20,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:20,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-11-18 12:47:20,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:20,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:20,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:16 [2018-11-18 12:47:20,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:20,728 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:47:20,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:47:20,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:47:20,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 12:47:20,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:47:20,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:47:20,730 INFO L87 Difference]: Start difference. First operand 316 states and 360 transitions. Second operand 5 states. [2018-11-18 12:47:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:47:21,759 INFO L93 Difference]: Finished difference Result 348 states and 391 transitions. [2018-11-18 12:47:21,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:47:21,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-18 12:47:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:47:21,761 INFO L225 Difference]: With dead ends: 348 [2018-11-18 12:47:21,761 INFO L226 Difference]: Without dead ends: 348 [2018-11-18 12:47:21,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 12:47:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-11-18 12:47:21,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 308. [2018-11-18 12:47:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-18 12:47:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 351 transitions. [2018-11-18 12:47:21,769 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 351 transitions. Word has length 16 [2018-11-18 12:47:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:47:21,770 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 351 transitions. [2018-11-18 12:47:21,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 12:47:21,771 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 351 transitions. [2018-11-18 12:47:21,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 12:47:21,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:47:21,772 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:21,772 INFO L423 AbstractCegarLoop]: === Iteration 7 === [containsHeadErr19REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-18 12:47:21,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:21,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1410785758, now seen corresponding path program 1 times [2018-11-18 12:47:21,773 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:47:21,773 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:47:21,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:21,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:21,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:47:21,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:47:21,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:21,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:21,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-18 12:47:21,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 12:47:21,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:21,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:21,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:21,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-18 12:47:21,958 INFO L477 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 16 [2018-11-18 12:47:21,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:21,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 12:47:21,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:21,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:21,992 INFO L477 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 16 [2018-11-18 12:47:21,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:21,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-18 12:47:21,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-11-18 12:47:22,094 INFO L477 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 22 treesize of output 16 [2018-11-18 12:47:22,099 INFO L477 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 16 treesize of output 3 [2018-11-18 12:47:22,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,124 INFO L477 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 22 treesize of output 16 [2018-11-18 12:47:22,127 INFO L477 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 16 treesize of output 3 [2018-11-18 12:47:22,127 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,134 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-18 12:47:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:22,165 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:47:22,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:47:22,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 12:47:22,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 12:47:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 12:47:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 12:47:22,168 INFO L87 Difference]: Start difference. First operand 308 states and 351 transitions. Second operand 9 states. [2018-11-18 12:47:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:47:22,854 INFO L93 Difference]: Finished difference Result 322 states and 368 transitions. [2018-11-18 12:47:22,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 12:47:22,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-18 12:47:22,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:47:22,855 INFO L225 Difference]: With dead ends: 322 [2018-11-18 12:47:22,856 INFO L226 Difference]: Without dead ends: 322 [2018-11-18 12:47:22,856 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-18 12:47:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-18 12:47:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 316. [2018-11-18 12:47:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-11-18 12:47:22,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 361 transitions. [2018-11-18 12:47:22,863 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 361 transitions. Word has length 25 [2018-11-18 12:47:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:47:22,863 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 361 transitions. [2018-11-18 12:47:22,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 12:47:22,864 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 361 transitions. [2018-11-18 12:47:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 12:47:22,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:47:22,864 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:22,865 INFO L423 AbstractCegarLoop]: === Iteration 8 === [containsHeadErr19REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-18 12:47:22,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:22,865 INFO L82 PathProgramCache]: Analyzing trace with hash 916726337, now seen corresponding path program 1 times [2018-11-18 12:47:22,865 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:47:22,865 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:47:22,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:22,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:22,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 12:47:22,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:47:22,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 12:47:22,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:47:22,972 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:22,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-18 12:47:23,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:23,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 12:47:23,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:47:23,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 12:47:23,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 12:47:23,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 12:47:23,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-18 12:47:23,084 INFO L87 Difference]: Start difference. First operand 316 states and 361 transitions. Second operand 8 states. [2018-11-18 12:47:23,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:47:23,665 INFO L93 Difference]: Finished difference Result 321 states and 366 transitions. [2018-11-18 12:47:23,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 12:47:23,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-11-18 12:47:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 12:47:23,667 INFO L225 Difference]: With dead ends: 321 [2018-11-18 12:47:23,667 INFO L226 Difference]: Without dead ends: 321 [2018-11-18 12:47:23,667 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:47:23,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-11-18 12:47:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2018-11-18 12:47:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-11-18 12:47:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 364 transitions. [2018-11-18 12:47:23,676 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 364 transitions. Word has length 27 [2018-11-18 12:47:23,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 12:47:23,677 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 364 transitions. [2018-11-18 12:47:23,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 12:47:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 364 transitions. [2018-11-18 12:47:23,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-18 12:47:23,678 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 12:47:23,678 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:47:23,678 INFO L423 AbstractCegarLoop]: === Iteration 9 === [containsHeadErr19REQUIRES_VIOLATION, containsHeadErr41REQUIRES_VIOLATION, containsHeadErr18REQUIRES_VIOLATION, containsHeadErr20REQUIRES_VIOLATION, containsHeadErr40REQUIRES_VIOLATION, containsHeadErr16REQUIRES_VIOLATION, containsHeadErr37REQUIRES_VIOLATION, containsHeadErr39REQUIRES_VIOLATION, containsHeadErr17REQUIRES_VIOLATION, containsHeadErr38REQUIRES_VIOLATION, containsHeadErr35REQUIRES_VIOLATION, containsHeadErr13REQUIRES_VIOLATION, containsHeadErr34REQUIRES_VIOLATION, containsHeadErr15REQUIRES_VIOLATION, containsHeadErr36REQUIRES_VIOLATION, containsHeadErr14REQUIRES_VIOLATION, containsHeadErr11REQUIRES_VIOLATION, containsHeadErr32REQUIRES_VIOLATION, containsHeadErr10REQUIRES_VIOLATION, containsHeadErr12REQUIRES_VIOLATION, containsHeadErr33REQUIRES_VIOLATION, containsHeadErr8REQUIRES_VIOLATION, containsHeadErr29REQUIRES_VIOLATION, containsHeadErr31REQUIRES_VIOLATION, containsHeadErr9REQUIRES_VIOLATION, containsHeadErr30REQUIRES_VIOLATION, containsHeadErr27REQUIRES_VIOLATION, containsHeadErr5REQUIRES_VIOLATION, containsHeadErr26REQUIRES_VIOLATION, containsHeadErr7REQUIRES_VIOLATION, containsHeadErr28REQUIRES_VIOLATION, containsHeadErr6REQUIRES_VIOLATION, containsHeadErr3REQUIRES_VIOLATION, containsHeadErr24REQUIRES_VIOLATION, containsHeadErr2REQUIRES_VIOLATION, containsHeadErr4REQUIRES_VIOLATION, containsHeadErr25REQUIRES_VIOLATION, containsHeadErr0REQUIRES_VIOLATION, containsHeadErr21REQUIRES_VIOLATION, containsHeadErr23REQUIRES_VIOLATION, containsHeadErr1REQUIRES_VIOLATION, containsHeadErr22REQUIRES_VIOLATION, containsBodyErr28REQUIRES_VIOLATION, containsBodyErr6REQUIRES_VIOLATION, containsBodyErr7REQUIRES_VIOLATION, containsBodyErr5REQUIRES_VIOLATION, containsBodyErr27REQUIRES_VIOLATION, containsBodyErr26REQUIRES_VIOLATION, containsBodyErr31REQUIRES_VIOLATION, containsBodyErr30REQUIRES_VIOLATION, containsBodyErr9REQUIRES_VIOLATION, containsBodyErr8REQUIRES_VIOLATION, containsBodyErr29REQUIRES_VIOLATION, containsBodyErr12REQUIRES_VIOLATION, containsBodyErr33REQUIRES_VIOLATION, containsBodyErr11REQUIRES_VIOLATION, containsBodyErr32REQUIRES_VIOLATION, containsBodyErr10REQUIRES_VIOLATION, containsBodyErr15REQUIRES_VIOLATION, containsBodyErr36REQUIRES_VIOLATION, containsBodyErr14REQUIRES_VIOLATION, containsBodyErr35REQUIRES_VIOLATION, containsBodyErr13REQUIRES_VIOLATION, containsBodyErr34REQUIRES_VIOLATION, containsBodyErr39REQUIRES_VIOLATION, containsBodyErr17REQUIRES_VIOLATION, containsBodyErr38REQUIRES_VIOLATION, containsBodyErr16REQUIRES_VIOLATION, containsBodyErr37REQUIRES_VIOLATION, containsBodyErr20REQUIRES_VIOLATION, containsBodyErr41REQUIRES_VIOLATION, containsBodyErr19REQUIRES_VIOLATION, containsBodyErr40REQUIRES_VIOLATION, containsBodyErr18REQUIRES_VIOLATION, containsBodyErr1REQUIRES_VIOLATION, containsBodyErr23REQUIRES_VIOLATION, containsBodyErr22REQUIRES_VIOLATION, containsBodyErr0REQUIRES_VIOLATION, containsBodyErr21REQUIRES_VIOLATION, containsBodyErr4REQUIRES_VIOLATION, containsBodyErr25REQUIRES_VIOLATION, containsBodyErr24REQUIRES_VIOLATION, containsBodyErr2REQUIRES_VIOLATION, containsBodyErr3REQUIRES_VIOLATION, mainErr15ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr27ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION, mainErr23ASSERT_VIOLATIONMEMORY_FREE, mainErr30ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr21REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10ASSERT_VIOLATIONMEMORY_FREE, mainErr25REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr26ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr22ASSERT_VIOLATIONMEMORY_FREE, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr11ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, appendErr20REQUIRES_VIOLATION, appendErr18REQUIRES_VIOLATION, appendErr19REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr22REQUIRES_VIOLATION, appendErr23REQUIRES_VIOLATION, appendErr21REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr14REQUIRES_VIOLATION, appendErr15REQUIRES_VIOLATION, appendErr13REQUIRES_VIOLATION, appendErr17REQUIRES_VIOLATION, appendErr16REQUIRES_VIOLATION, appendErr9REQUIRES_VIOLATION, appendErr8REQUIRES_VIOLATION, appendErr12REQUIRES_VIOLATION, appendErr10REQUIRES_VIOLATION, appendErr11REQUIRES_VIOLATION, appendErr25REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr24REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr5REQUIRES_VIOLATION]=== [2018-11-18 12:47:23,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:47:23,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1333356693, now seen corresponding path program 1 times [2018-11-18 12:47:23,679 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 12:47:23,679 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 12:47:23,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:23,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:23,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-18 12:47:23,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:23,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:23,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-18 12:47:23,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 12:47:23,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:47:23,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:23,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:23,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:23,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-18 12:47:23,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 12:47:23,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-18 12:47:23,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:25,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-18 12:47:25,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:25,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:25,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:25,153 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:41, output treesize:76 [2018-11-18 12:47:25,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 68 [2018-11-18 12:47:25,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:25,336 INFO L477 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 64 treesize of output 79 [2018-11-18 12:47:25,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:25,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:28,997 INFO L477 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 3 case distinctions, treesize of input 44 treesize of output 55 [2018-11-18 12:47:28,998 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:29,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:29,179 INFO L477 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 34 treesize of output 29 [2018-11-18 12:47:29,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:29,184 INFO L477 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 [2018-11-18 12:47:29,184 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:29,198 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:29,269 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 3 xjuncts. [2018-11-18 12:47:29,269 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:106, output treesize:120 [2018-11-18 12:47:29,394 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 12:47:29,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:29,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:29,480 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:29,481 INFO L477 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 29 treesize of output 33 [2018-11-18 12:47:29,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:29,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:29,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:144, output treesize:60 [2018-11-18 12:47:29,636 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:29,637 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:29,639 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:29,639 INFO L477 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 32 treesize of output 56 [2018-11-18 12:47:29,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:29,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:29,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:82 [2018-11-18 12:47:29,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-11-18 12:47:29,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:47:29,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:29,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:29,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:29,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:82 [2018-11-18 12:47:30,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-11-18 12:47:30,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:47:30,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:30,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:30,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:30,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:91 [2018-11-18 12:47:30,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2018-11-18 12:47:30,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 12:47:30,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:30,310 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:30,311 INFO L477 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 15 treesize of output 8 [2018-11-18 12:47:30,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:30,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-18 12:47:30,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:30,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:30,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:30,349 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:85, output treesize:31 [2018-11-18 12:47:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:30,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:47:38,572 WARN L832 $PredicateComparison]: unable to prove that (forall ((append_~node~0.offset (_ BitVec 32)) (|append_#t~mem58.base| (_ BitVec 32)) (|v_append_#t~malloc54.base_2| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_append_#t~malloc54.base_2| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| |v_append_#t~malloc54.base_2| (store (store (select |c_#memory_$Pointer$.base| |v_append_#t~malloc54.base_2|) (bvadd append_~node~0.offset (_ bv1 32)) |append_#t~mem58.base|) (bvadd append_~node~0.offset (_ bv5 32)) (_ bv0 32))) |c_append_#in~head.base|) (bvadd |c_append_#in~head.offset| (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_append_#t~malloc54.base_2|) (_ bv0 1))))) is different from false [2018-11-18 12:47:46,492 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 12:47:46,712 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 12:47:46,835 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-18 12:47:46,858 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 74 [2018-11-18 12:47:47,022 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-11-18 12:47:47,037 INFO L477 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 11 treesize of output 10 [2018-11-18 12:47:47,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:47,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:47,101 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:47,110 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:47,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 79 [2018-11-18 12:47:47,252 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:47,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 12:47:47,700 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:47,701 INFO L477 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 31 treesize of output 39 [2018-11-18 12:47:47,701 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:49,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:49,061 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:49,061 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:49,062 INFO L477 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 28 treesize of output 45 [2018-11-18 12:47:49,063 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:49,109 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:49,191 INFO L477 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 46 treesize of output 40 [2018-11-18 12:47:49,208 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:49,210 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:49,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-11-18 12:47:49,211 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:49,223 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:49,227 INFO L477 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 46 treesize of output 40 [2018-11-18 12:47:49,231 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:47:49,232 INFO L477 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 32 treesize of output 19 [2018-11-18 12:47:49,232 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:49,244 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:49,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:49,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:49,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:49,327 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:127, output treesize:29 [2018-11-18 12:47:51,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:47:51,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_88efbf71-8cb6-4d76-aca5-2d965e30f357/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:47:51,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:47:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:47:51,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:47:53,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-18 12:47:53,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:47:53,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:53,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:53,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:53,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-11-18 12:47:54,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-11-18 12:47:54,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-18 12:47:54,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:55,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-11-18 12:47:55,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:55,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:55,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:55,527 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:50, output treesize:94 [2018-11-18 12:47:55,776 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2018-11-18 12:47:55,784 INFO L477 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 43 treesize of output 38 [2018-11-18 12:47:55,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:55,789 INFO L477 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 [2018-11-18 12:47:55,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:55,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:55,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 77 [2018-11-18 12:47:55,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:57,440 INFO L477 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 63 [2018-11-18 12:47:57,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 12:47:57,577 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:57,578 INFO L477 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 63 treesize of output 78 [2018-11-18 12:47:57,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:57,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:47:57,785 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 3 xjuncts. [2018-11-18 12:47:57,785 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:124, output treesize:147 [2018-11-18 12:47:58,022 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 12:47:58,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,089 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,090 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-11-18 12:47:58,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:58,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:171, output treesize:64 [2018-11-18 12:47:58,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:58,234 INFO L477 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 32 treesize of output 62 [2018-11-18 12:47:58,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:58,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:75, output treesize:82 [2018-11-18 12:47:58,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-11-18 12:47:58,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:47:58,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:58,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:82 [2018-11-18 12:47:58,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-11-18 12:47:58,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-18 12:47:58,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:58,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:58,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:91 [2018-11-18 12:47:58,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2018-11-18 12:47:58,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 12:47:58,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:59,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:47:59,018 INFO L477 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 15 treesize of output 8 [2018-11-18 12:47:59,018 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:59,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-18 12:47:59,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 12:47:59,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:47:59,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 12:47:59,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:85, output treesize:31 [2018-11-18 12:47:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:47:59,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 12:48:00,063 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 12:48:00,261 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-18 12:48:00,403 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-18 12:48:00,666 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-11-18 12:48:00,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:00,683 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:00,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:00,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 196 [2018-11-18 12:48:00,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:00,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 120 [2018-11-18 12:48:01,067 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-11-18 12:48:01,075 INFO L477 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 11 treesize of output 10 [2018-11-18 12:48:01,075 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:01,138 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:01,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 93 [2018-11-18 12:48:01,264 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:01,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2018-11-18 12:48:01,627 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:01,643 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:01,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:01,645 INFO L477 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 31 treesize of output 55 [2018-11-18 12:48:01,645 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:04,772 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:04,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 36 [2018-11-18 12:48:04,773 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:06,829 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:48:07,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 12:48:07,905 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:07,906 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:07,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:07,918 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-18 12:48:07,918 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:07,934 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:07,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 12:48:07,993 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:48:07,993 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:07,994 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-18 12:48:07,994 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:08,004 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:08,029 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:48:08,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:48:08,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:08,091 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:136, output treesize:20 [2018-11-18 12:48:16,854 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-18 12:48:25,257 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-18 12:48:25,326 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 94 [2018-11-18 12:48:25,502 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-18 12:48:25,511 INFO L477 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 11 treesize of output 10 [2018-11-18 12:48:25,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:25,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 78 [2018-11-18 12:48:26,031 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-18 12:48:26,036 INFO L477 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 52 treesize of output 55 [2018-11-18 12:48:26,041 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:26,042 INFO L477 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 20 treesize of output 28 [2018-11-18 12:48:26,042 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:26,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:26,085 INFO L477 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 61 treesize of output 64 [2018-11-18 12:48:26,093 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:26,095 INFO L477 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 20 treesize of output 28 [2018-11-18 12:48:26,095 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:26,144 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:26,150 INFO L477 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 73 treesize of output 76 [2018-11-18 12:48:26,155 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:26,156 INFO L477 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 20 treesize of output 28 [2018-11-18 12:48:26,157 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:26,210 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:48:28,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 63 [2018-11-18 12:48:28,113 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:28,114 INFO L477 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 54 treesize of output 62 [2018-11-18 12:48:28,115 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:28,227 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:30,537 INFO L477 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 3 case distinctions, treesize of input 54 treesize of output 73 [2018-11-18 12:48:30,538 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-18 12:48:30,662 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:48:31,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 74 [2018-11-18 12:48:31,845 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:33,932 INFO L477 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 3 case distinctions, treesize of input 65 treesize of output 84 [2018-11-18 12:48:33,932 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-18 12:48:34,098 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:34,099 INFO L477 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 65 treesize of output 73 [2018-11-18 12:48:34,100 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:34,269 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 12:48:34,834 INFO L477 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 66 treesize of output 60 [2018-11-18 12:48:34,840 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:34,841 INFO L477 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 17 treesize of output 7 [2018-11-18 12:48:34,841 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:34,870 INFO L477 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 24 treesize of output 28 [2018-11-18 12:48:34,898 INFO L477 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 6 [2018-11-18 12:48:34,898 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:34,916 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-11-18 12:48:34,917 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:34,954 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-18 12:48:35,035 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-18 12:48:35,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2018-11-18 12:48:35,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-11-18 12:48:35,063 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:48:35,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:35,138 INFO L477 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 48 treesize of output 39 [2018-11-18 12:48:35,139 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:35,220 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:35,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 60 [2018-11-18 12:48:35,248 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:35,329 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:48:35,338 INFO L477 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 66 treesize of output 60 [2018-11-18 12:48:35,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:35,345 INFO L477 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 17 treesize of output 7 [2018-11-18 12:48:35,345 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:35,377 INFO L477 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 24 treesize of output 28 [2018-11-18 12:48:35,404 INFO L477 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 6 [2018-11-18 12:48:35,405 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:35,421 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 12:48:35,421 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:35,454 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-18 12:48:35,531 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-18 12:48:35,543 INFO L477 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 60 [2018-11-18 12:48:35,550 INFO L477 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 24 treesize of output 28 [2018-11-18 12:48:35,577 INFO L477 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 6 [2018-11-18 12:48:35,577 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:35,597 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 12:48:35,598 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:35,645 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-18 12:48:35,782 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:35,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2018-11-18 12:48:35,806 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-18 12:48:35,918 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-18 12:48:35,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2018-11-18 12:48:35,946 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:35,947 INFO L477 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 52 treesize of output 43 [2018-11-18 12:48:35,947 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:36,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2018-11-18 12:48:36,035 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:48:36,138 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:36,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 60 [2018-11-18 12:48:36,164 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:36,250 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 12:48:36,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 57 [2018-11-18 12:48:36,301 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:36,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 59 [2018-11-18 12:48:36,352 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-11-18 12:48:36,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-18 12:48:36,465 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:48:36,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-11-18 12:48:36,469 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:48:36,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:36,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 88 [2018-11-18 12:48:36,677 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-18 12:48:36,889 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-11-18 12:48:38,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 65 [2018-11-18 12:48:38,560 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:38,561 INFO L477 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 60 treesize of output 51 [2018-11-18 12:48:38,561 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:38,659 INFO L477 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 44 treesize of output 47 [2018-11-18 12:48:38,717 INFO L477 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 6 [2018-11-18 12:48:38,718 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:38,737 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2018-11-18 12:48:38,737 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:38,795 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-18 12:48:39,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-11-18 12:48:39,013 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:39,017 INFO L477 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 38 treesize of output 30 [2018-11-18 12:48:39,018 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:39,023 INFO L477 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 49 treesize of output 41 [2018-11-18 12:48:39,023 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:39,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-11-18 12:48:39,028 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:39,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 69 [2018-11-18 12:48:39,620 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-18 12:48:39,656 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2018-11-18 12:48:39,657 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:39,664 INFO L477 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 57 treesize of output 49 [2018-11-18 12:48:39,665 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:39,690 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 65 [2018-11-18 12:48:39,691 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:40,026 INFO L477 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 59 treesize of output 55 [2018-11-18 12:48:40,027 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 2 xjuncts. [2018-11-18 12:48:40,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 78 [2018-11-18 12:48:40,114 INFO L267 ElimStorePlain]: Start of recursive call 59: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-18 12:48:40,531 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-11-18 12:48:41,039 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:41,039 INFO L477 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 46 treesize of output 37 [2018-11-18 12:48:41,040 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:41,044 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:41,045 INFO L477 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 47 treesize of output 38 [2018-11-18 12:48:41,046 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:41,051 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:41,052 INFO L477 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 60 treesize of output 51 [2018-11-18 12:48:41,053 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:41,059 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:41,060 INFO L477 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 55 treesize of output 46 [2018-11-18 12:48:41,060 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:41,065 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:41,067 INFO L477 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 63 treesize of output 54 [2018-11-18 12:48:41,067 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:41,072 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:41,073 INFO L477 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 60 treesize of output 51 [2018-11-18 12:48:41,073 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:41,078 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:41,078 INFO L477 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 43 treesize of output 34 [2018-11-18 12:48:41,079 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:41,084 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:41,085 INFO L477 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 51 treesize of output 42 [2018-11-18 12:48:41,085 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:41,400 INFO L267 ElimStorePlain]: Start of recursive call 45: 5 dim-1 vars, End of recursive call: 6 dim-0 vars, and 11 xjuncts. [2018-11-18 12:48:41,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 64 [2018-11-18 12:48:41,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2018-11-18 12:48:41,459 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 12:48:41,677 INFO L477 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 50 treesize of output 42 [2018-11-18 12:48:41,677 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:41,882 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:41,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 85 [2018-11-18 12:48:41,950 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-11-18 12:48:42,288 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:42,289 INFO L477 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 42 treesize of output 33 [2018-11-18 12:48:42,290 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:42,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:42,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 62 [2018-11-18 12:48:42,674 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:43,065 INFO L477 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 31 treesize of output 23 [2018-11-18 12:48:43,065 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:43,076 INFO L477 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 45 treesize of output 37 [2018-11-18 12:48:43,076 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:43,400 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 12:48:43,401 INFO L477 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 49 treesize of output 40 [2018-11-18 12:48:43,402 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:43,781 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2018-11-18 12:48:43,781 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:44,055 INFO L267 ElimStorePlain]: Start of recursive call 68: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 9 xjuncts. [2018-11-18 12:48:46,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 68 [2018-11-18 12:48:46,500 INFO L477 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 55 treesize of output 58 [2018-11-18 12:48:46,589 INFO L477 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 6 [2018-11-18 12:48:46,589 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-18 12:48:46,611 INFO L477 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2018-11-18 12:48:46,611 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-18 12:48:46,705 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-18 12:48:48,588 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 12:48:48,589 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_prenex_50 term size 55 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 12:48:48,591 INFO L168 Benchmark]: Toolchain (without parser) took 92626.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 470.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:48:48,591 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:48:48,591 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2018-11-18 12:48:48,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:48:48,592 INFO L168 Benchmark]: Boogie Preprocessor took 36.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:48:48,592 INFO L168 Benchmark]: RCFGBuilder took 1011.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.5 MB). Peak memory consumption was 87.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:48:48,592 INFO L168 Benchmark]: TraceAbstraction took 91082.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.1 MB). Peak memory consumption was 411.1 MB. Max. memory is 11.5 GB. [2018-11-18 12:48:48,594 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 466.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1011.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.5 MB). Peak memory consumption was 87.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 91082.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.8 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -80.1 MB). Peak memory consumption was 411.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_50 term size 55 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_50 term size 55: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...